Have a personal or library account? Click to login
Application of genetic algorithms in optimization of SFR nuclear reactor design Cover

Application of genetic algorithms in optimization of SFR nuclear reactor design

Open Access
|Nov 2021

Abstract

This work presents a demonstrational application of genetic algorithms (GAs) to solve sample optimization problems in the generation IV nuclear reactor core design. The new software was developed implementing novel GAs, and it was applied to show their capabilities by presenting an example solution of two selected problems to check whether GAs can be used successfully in reactor engineering as an optimization tool. The 3600 MWth oxide core, which was based on the OECD/NEA sodium-cooled fast reactor (SFR) benchmark, was used a reference design [1]. The first problem was the optimization of the fuel isotopic inventory in terms of minimizing the volume share of long-lived actinides, while maximizing the effective neutron multiplication factor. The second task was the optimization of the boron shield distribution around the reactor core to minimize the sodium void reactivity effect (SVRE). Neutron transport and fuel depletion simulations were performed using Monte Carlo neutron transport code SERPENT2. The simulation resulted in an optimized fuel mixture composition for the selected parameters, which demonstrates the functionality of the algorithm. The results show the efficiency and universality of GAs in multidimensional optimization problems in nuclear engineering.

DOI: https://doi.org/10.2478/nuka-2021-0021 | Journal eISSN: 1508-5791 | Journal ISSN: 0029-5922
Language: English
Page range: 139 - 145
Submitted on: Jan 19, 2021
Accepted on: Apr 21, 2021
Published on: Nov 25, 2021
Published by: Institute of Nuclear Chemistry and Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2021 Wojciech Żurkowski, Piotr Sawicki, Wojciech Kubiński, Piotr Darnowski, published by Institute of Nuclear Chemistry and Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.