Artificial Intelligence Methods Applied to the In-Core Fuel Management Optimization

The In-Core Fuel Management Optimization (ICFMO), also known as Loading Pattern (LP) design optimization problem or nuclear reactor reload problem, is a classical problem in Nuclear Engineering. During the nuclear reactor fuel reloading operation periodically executed in Nuclear Power Plants (NPPs), part of the nuclear fuel is substituted. It is a realworld problem studied for more than four decades and several techniques have been used for its solution, such as optimization techniques and human expert knowledge. For example, early applications of Mathematical Programming methods for the solution of the ICFMO were made with Dynamic Programming (Wall & Fenech, 1965), and with Linear and Quadratic Programming (Tabak, 1968). The ICFMO presents characteristics such as high-dimensionality, the large number of feasible solutions, disconnected feasible regions in the search space (Stevens et al., 1995) as well as the high computational cost of the evaluation function and lack of derivative information, which contribute to the challenge of the optimization of the ICFMO. Notwithstanding, algorithms known as generic heuristic methods, or metaheuristics (Taillard et al., 2001), have demonstrated an outstanding capability of dealing with complex search spaces, specially in the case of the ICFMO. Such Artificial Intelligence (AI) algorithms, besides the low coupling to the specificities of the problems, have some characteristics such as the memorization of solutions (or characteristics of solutions), which allows the algorithm to retain intrinsic patterns of optimal or near-optimal solutions or, in other words, “inner” heuristics as described by Gendreau & Potvin (2005). As search methodologies, metaheuristics may have in common: diversification, in order to to explore different areas; mechanisms of intensification, in order to exploit specific areas of the search space; memory, in order to retain the best solutions; and tuning of parameters (Siarry & Zbigniew, 2008). Metaheuristics such as Simulated Annealing (SA; Kirkpatrick et al., 1983), Genetic Algorithm (GA; Goldberg, 1989), Population-Based Incremental Learning (PBIL; Baluja, 1994), Ant Colony System (ACS; Dorigo & Gambardella, 1997) and Particle Swarm Optimization (PSO; Kennedy & Eberhart, 2001) have been applied to several problems in different areas with considerable success. In the case of the ICFMO, metaheuristics have provided outstanding results since the earliest applications of the SA to this problem (Parks, 5

[1]  Teuvo Kohonen,et al.  The self-organizing map , 1990, Neurocomputing.

[2]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[3]  Luca Maria Gambardella,et al.  A new approach for heuristics-guided search in the In-Core Fuel Management Optimization , 2010 .

[4]  Geoffrey T. Parks,et al.  Multiobjective pressurized water reactor reload core design by nondominated genetic algorithm search , 1996 .

[5]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[6]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[7]  C. C. Pain,et al.  Genetic algorithms and artificial neural networks for loading pattern optimisation of advanced gas-cooled reactors , 2004 .

[8]  Roberto Schirru,et al.  Artificial Intelligence Methods Applied to the In-Core Nuclear Fuel Management Optimization , 2010 .

[9]  H. Fenech,et al.  THE APPLICATION OF DYNAMIC PROGRAMMING TO FUEL-MANAGEMENT OPTIMIZATION , 1964 .

[10]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[11]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[12]  Roberto Schirru,et al.  Identification of nuclear power plant transients using the Particle Swarm Optimization algorithm , 2008 .

[13]  Alexander Sesonske,et al.  PRESSURIZED WATER REACTOR OPTIMAL FUEL MANAGEMENT. , 1972 .

[14]  Roberto Schirru,et al.  A nuclear reactor core fuel reload optimization using artificial ant colony connective networks , 2008 .

[15]  Geoffrey T. Parks,et al.  An Intelligent Stochastic Optimization Routine for Nuclear Fuel Cycle Design , 1990 .

[16]  Adem Erdoğan,et al.  A PWR reload optimisation code (XCore) using artificial neural networks and genetic algorithms , 2003 .

[17]  Roberto Schirru,et al.  A new approach to the use of genetic algorithms to solve the pressurized water reactor's fuel management optimization problem , 1999 .

[18]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[19]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[20]  M. Sumini,et al.  A well-balanced coarse-mesh flux expansion method , 1994 .

[21]  Roberto Schirru,et al.  Particle Swarm Optimization in Reactor Core Design , 2006 .

[22]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[23]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[24]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[25]  Alex Galperin.  Exploration of the search space of the in-core fuel management problem by knowledge-based techniques , 1995 .

[26]  Roberto Schirru,et al.  Parameterless evolutionary algorithm applied to the nuclear reload problem , 2008 .

[27]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[28]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[29]  G.I. Maldonado.  Optimizing LWR cost of margin one fuel pin at a time , 2004, IEEE Symposium Conference Record Nuclear Science 2004..

[30]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[31]  Geoffrey T. Parks,et al.  Optimizing PWR Reload Core Designs , 1992, PPSN.

[32]  T. J. Downar,et al.  Optimization of pressurized water reactor shuffling by simulated annealing with heuristics , 1995 .

[33]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[34]  Constantino Tsallis,et al.  Optimization by Simulated Annealing: Recent Progress , 1995 .

[35]  Roberto Schirru,et al.  Particle Swarm Optimization applied to the nuclear reload problem of a Pressurized Water Reactor , 2009 .

[36]  A. Sesonske,et al.  IN-CORE FUEL MANAGEMENT OPTIMIZATION. , 1970 .

[37]  A. Galperin,et al.  Application of knowledge-based methods to in-core fuel management , 1991 .

[38]  Zbigniew Michalewicz,et al.  Advances in Metaheuristics for Hard Optimization , 2008, Advances in Metaheuristics for Hard Optimization.

[39]  J. Potvin,et al.  Tabu Search , 2018, Handbook of Metaheuristics.

[40]  Roberto Schirru,et al.  The Ant-Q algorithm applied to the nuclear reload problem , 2002 .

[41]  Daniel Tabak.  Optimization of Nuclear Reactor Fuel Recycle via Linear and Quadratic Programming , 1968 .