| Summary: | Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Nuclear Science and Engineering, 2012. === Cataloged from PDF version of thesis. === Includes bibliographical references (p. 38-40). === In order to promote nuclear power production as an attractive option for power generation, measures must be taken to ensure that the process is both safe and economical. One aspect of the nuclear fuel cycle that contributes significantly towards such goals is the management of the fuel. Proper fuel management within a reactor core requires an understanding of the trade-offs between maximizing the reactivity, while simultaneously minimizing the power peaking. To accomplish this, various algorithmic methods can be used to help determine the optimal arrangement of fuel bundles in the core. By exploiting innovative computational tools for the analyses of reactor cores, more accurate and precise calculations can be made, and nuclear power generation can continue to be safe and economical. While traditionally, heuristic algorithms have been used for these large optimization problems, more direct algorithms may have the potential to provide the most favorable configuration for the reactor core. The use of Greedy Exhaustive Dual Binary Swaps (GEDBS) was implemented for the optimization of the quarter-core of a reactor containing 193 fuel assemblies. The primary objective was to investigate the quality of the output from the GEDBS algorithm and to compare it to those of other algorithmic methods. In this way, conclusions could be made as to whether or not the end results from this exhaustive algorithm justified the added runtime associated with their use, and ultimately, help to determine its viability for future research. === by Jessica L. Hammond. === S.B.
|
|---|
