Application of Genetic Algorithm methodologies in fuel bundle burnup optimization of Pressurized Heavy Water Reactor
- 1. Electronics, Instrumentation and Radiological Safety Group (EIRSG), Indira Gandhi Centre for Atomic Research (IGCAR), Kalpakkam, Tamil Nadu (India)
- 2. Reactor Physics Section, Madras Atomic Power Station (MAPS), Kalpakkam, Tamil Nadu (India)
- 3. Resources Management Group (RMG), Indira Gandhi Centre for Atomic Research (IGCAR), Kalpakkam, Tamil Nadu (India)
Description
Highlights: • We study and compare Genetic Algorithms (GA) in the fuel bundle burnup optimization of an Indian Pressurized Heavy Water Reactor (PHWR) of 220 MWe. • Two Genetic Algorithm methodologies namely, Penalty Functions based GA and Multi Objective GA are considered. • For the selected problem, Multi Objective GA performs better than Penalty Functions based GA. • In the present study, Multi Objective GA outperforms Penalty Functions based GA in convergence speed and better diversity in solutions. - Abstract: The work carried out as a part of application and comparison of GA techniques in nuclear reactor environment is presented in the study. The nuclear fuel management optimization problem selected for the study aims at arriving appropriate reference discharge burnup values for the two burnup zones of 220 MWe Pressurized Heavy Water Reactor (PHWR) core. Two Genetic Algorithm methodologies namely, Penalty Functions based GA and Multi Objective GA are applied in this study. The study reveals, for the selected problem of PHWR fuel bundle burnup optimization, Multi Objective GA is more suitable than Penalty Functions based GA in the two aspects considered: by way of producing diverse feasible solutions and the convergence speed being better, i.e. it is capable of generating more number of feasible solutions, from earlier generations. It is observed that for the selected problem, the Multi Objective GA is 25.0% faster than Penalty Functions based GA with respect to CPU time, for generating 80% of the population with feasible solutions. When average computational time of fixed generations are considered, Penalty Functions based GA is 44.5% faster than Multi Objective GA. In the overall performance, the convergence speed of Multi Objective GA surpasses the computational time advantage of Penalty Functions based GA. The ability of Multi Objective GA in producing more diverse feasible solutions is a desired feature of the problem selected, that helps the reactor operator in getting more choices when deciding the appropriate discharge burnups of the core zones
Availability note (English)
Available from http://dx.doi.org/10.1016/j.nucengdes.2014.11.013Additional details
Identifiers
- DOI
- 10.1016/j.nucengdes.2014.11.013;
- PII
- S0029-5493(14)00623-2;
Publishing Information
- Journal Title
- Nuclear Engineering and Design
- Journal Volume
- 281
- Journal Page Range
- p. 58-71
- ISSN
- 0029-5493
- CODEN
- NEDEAU
INIS
- Country of Publication
- Netherlands
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 46100841
- Subject category
- S42: ENGINEERING;
- Descriptors DEI
- ALGORITHMS; BURNUP; FUEL ELEMENT CLUSTERS; INDIA; NUCLEAR FUELS; OPTIMIZATION; PHWR TYPE REACTORS; REACTOR OPERATORS
- Descriptors DEC
- ASIA; DEVELOPING COUNTRIES; ENERGY SOURCES; FUEL ASSEMBLIES; FUELS; HEAVY WATER COOLED REACTORS; HEAVY WATER MODERATED REACTORS; MATERIALS; MATHEMATICAL LOGIC; PERSONNEL; REACTOR MATERIALS; REACTORS
Optional Information
- Copyright
- Copyright (c) 2014 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.