Hybrid method for in-core optimization of pressurized water reactor reload core design

摘要

The objective of this research is the development of an accurate, practical, and robust method for optimization of the design of loading patterns for pressurized water reactors, a nonlinear, non-convex, integer optimization problem. The many logical constraints which may be applied during the design process are modeled herein by a network construction upon which performance objectives and safety constraints from reactor physics calculations are optimized. This thesis presents the synthesis of the strengths of previous algorithms developed for reload design optimization and extension of robustness through development of a hybrid liberated search algorithm. Development of three independent methods for reload design optimization is presented: random direct search for local improvement, liberated search by simulated annealing, and deterministic search for local improvement via successive linear assignment by branch and bound. Comparative application of the methods to a variety of problems is discussed, including an exhaustive enumeration benchmark created to allow comparison of search results to a known global optimum for a large scale problem. While direct search and determinism are shown to be capable of finding improvement, only the liberation of simulated annealing is found to perform robustly in the non-convex design spaces. The hybrid method SHAMAN is presented. The algorithm applies: determinism to shuffle an initial solution for satisfaction of heuristics and symmetry; liberated search through simulated annealing with a bounds cooling constraint treatment; and search bias through relational heuristics for the application of engineering judgment. The accuracy, practicality, and robustness of the SHAMAN algorithm is demonstrated through application to a variety of reload loading pattern optimization problems.