Show simple item record

contributor authorIsraeli, Ella
contributor authorGilad, Erez
date accessioned2017-11-25T07:18:41Z
date available2017-11-25T07:18:41Z
date copyright2017/25/5
date issued2017
identifier issn2332-8983
identifier otherners_003_03_030901.pdf
identifier urihttp://138.201.223.254:8080/yetl1/handle/yetl/4235320
description abstractNovel genetic algorithms (GAs) are developed by using state-of-the-art selection and crossover operators, e.g., rank selection or tournament selection instead of the traditional roulette (fitness proportionate (FP)) selection operator and novel crossover and mutation operators by considering the chromosomes as permutations (which is a specific feature of the loading pattern (LP) problem). The algorithm is applied to a representative model of a modern pressurized water reactor (PWR) core and implemented using a single objective fitness function (FF), i.e., keff. The results obtained for some reference cases using this setup are excellent. They are obtained using a tournament selection operator with a linear ranking (LR) selection probability method and a new geometric crossover operator that allows for geometrical, rather than random, swaps of gene segments between the chromosomes and control over the sizes of the swapped segments. Finally, the effect of boundary conditions (BCs) on the symmetry of the obtained best solutions is studied and the validity of the “symmetric loading patterns” assumption is tested.
publisherThe American Society of Mechanical Engineers (ASME)
titleNovel Genetic Algorithms for Loading Pattern Optimization Using State-of-the-Art Operators and a Simple Test Case
typeJournal Paper
journal volume3
journal issue3
journal titleJournal of Nuclear Engineering and Radiation Science
identifier doi10.1115/1.4035883
journal fristpage30901
journal lastpage030901-10
treeJournal of Nuclear Engineering and Radiation Science:;2017:;volume( 003 ):;issue: 003
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record