2026-09-19T18:09:43Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/955992022-01-13T07:54:05Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Kord S. Smith and Benoit Forget. Haugen, Carl C. (Carl Christopher) Massachusetts Institute of Technology. Department of Nuclear Science and Engineering. Massachusetts Institute of Technology. Department of Nuclear Science and Engineering 2015-02-25T17:13:00Z 2015-02-25T17:13:00Z 2014 2014 http://hdl.handle.net/1721.1/95599 903704220 Thesis: S.M., Massachusetts Institute of Technology, Department of Nuclear Science and Engineering, 2014. Cataloged from PDF version of thesis. Includes bibliographical references (pages 151-153). This thesis presents the development and analysis of a deterministic optimization scheme termed Greedy Exhaustive Dual Binary Swap for the optimization of nuclear reactor core loading patterns. The goal of this optimization scheme is to emulate the approach taken by an engineer when manually optimizing a reactor core loading pattern. This is to determine if this approach is able to locate high quality patterns that, due to their location in the core loading solution space, are consistently missed by standard stochastic optimization methods such as those in the genetic algorithm class, or those in the simulated annealing class. This optimization study is carried out using the poropy tool to handle the reactor physics model. Initially, optimizations are carried out using beginning of cycle eigenvalue as a surrogate for core excess reactivity and thus cycle length. The deterministic Dual Binary Swap is found to locate acceptable patterns less reliably than stochastic methods, but those that are located are of higher quality. Optimizations of the full depletion problem result in the deterministic Dual Binary Swap optimizer locating patterns that are of higher quality than those found by the stochastic Simulated Annealing, with comparable frequency. The Dual Binary Swap optimizer is, however, found to be very dependent on the starting core configuration, and can not reliably find a high quality pattern from any given starting configuration. by Carl C. Haugen. S.M. 153 pages eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Nuclear Science and Engineering. The Greedy Exhaustive Dual Binary Swap methodology for fuel loading optimization in PWR reactors using the poropy reactor optimization Tool Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6d0ae65b-5dea-4f82-8d00-67be17097c81"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>The Greedy Exhaustive Dual Binary Swap methodology for fuel loading optimization in PWR reactors using the poropy reactor optimization Tool</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2014</PublicationDate> <Authors> <Author> <DisplayName>Haugen, Carl C. (Carl Christopher)</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Nuclear Science and Engineering.</Keyword> <Abstract>This thesis presents the development and analysis of a deterministic optimization scheme termed Greedy Exhaustive Dual Binary Swap for the optimization of nuclear reactor core loading patterns. The goal of this optimization scheme is to emulate the approach taken by an engineer when manually optimizing a reactor core loading pattern. This is to determine if this approach is able to locate high quality patterns that, due to their location in the core loading solution space, are consistently missed by standard stochastic optimization methods such as those in the genetic algorithm class, or those in the simulated annealing class. This optimization study is carried out using the poropy tool to handle the reactor physics model. Initially, optimizations are carried out using beginning of cycle eigenvalue as a surrogate for core excess reactivity and thus cycle length. The deterministic Dual Binary Swap is found to locate acceptable patterns less reliably than stochastic methods, but those that are located are of higher quality. Optimizations of the full depletion problem result in the deterministic Dual Binary Swap optimizer locating patterns that are of higher quality than those found by the stochastic Simulated Annealing, with comparable frequency. The Dual Binary Swap optimizer is, however, found to be very dependent on the starting core configuration, and can not reliably find a high quality pattern from any given starting configuration.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>