Comparison of heuristic optimization techniques for the enrichment and gadolinia distribution in BWR fuel lattices and decision analysis

• Published in: Annals of nuclear energy Vol. 63; pp. 556 - 564
• Main Authors: Castillo, Alejandro, Martín-del-Campo, Cecilia, Montes-Tadeo, José-Luis, François, Juan-Luis, Ortiz-Servin, Juan-José, Perusquía-del-Cueto, Raúl
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.01.2014
• Subjects: BWR fuel lattice optimization; Heuristic optimization techniques; Position Vector of Minimum Regret; Position Vector of Minimum Regret; Heuristic optimization techniques; BWR fuel lattice optimization
• ISSN: 0306-4549; 1873-2100
• DOI: 10.1016/j.anucene.2013.08.039

•Different metaheuristic optimization techniques were compared.•The optimal enrichment and gadolinia distribution in a BWR fuel lattice was studied.•A decision making tool based on the Position Vector of Minimum Regret was applied.•Similar results were found for the different optimization techniques. In the present study a comparison of the performance of five heuristic techniques for optimization of combinatorial problems is shown. The techniques are: Ant Colony System, Artificial Neural Networks, Genetic Algorithms, Greedy Search and a hybrid of Path Relinking and Scatter Search. They were applied to obtain an “optimal” enrichment and gadolinia distribution in a fuel lattice of a boiling water reactor. All techniques used the same objective function for qualifying the different distributions created during the optimization process as well as the same initial conditions and restrictions. The parameters included in the objective function are the k-infinite multiplication factor, the maximum local power peaking factor, the average enrichment and the average gadolinia concentration of the lattice. The CASMO-4 code was used to obtain the neutronic parameters. The criteria for qualifying the optimization techniques include also the evaluation of the best lattice with burnup and the number of evaluations of the objective function needed to obtain the best solution. In conclusion all techniques obtain similar results, but there are methods that found better solutions faster than others. A decision analysis tool based on the Position Vector of Minimum Regret was applied to aggregate the criteria in order to rank the solutions according to three functions: neutronic grade at 0 burnup, neutronic grade with burnup and global cost which aggregates the computing time in the decision. According to the results Greedy Search found the best lattice in terms of the neutronic grade at 0 burnup and also with burnup. However, Greedy Search is unpredictable because its results are diverse and in average is the worst method in terms of the global cost which aggregates also the computing time to the final evaluation. Genetic Algorithms and Path Relinking coupled to Scatter Search have the best results in terms of global cost.