Survivor selection in a crossoverless evolutionary algorithm
Nielis Brouwer, Danny Dijkzeul, Levi Koppenhol, Iris Pijning, Daan van den Berg
Abstract
Nielis Brouwer, Danny Dijkzeul, Levi Koppenhol, Iris Pijning, Daan van den Berg
Abstract
The plant propagation algorithm is a crossoverless population based evolutionary algorithm, defaultly deploying the plus-selection method for survivor selection - combining parents and offspring population and then selecting the best popSize individuals. In this study, we explore eight different survivor selection methods (plus and comma selection, tournament selection with and without replacement, elitist tournament selection, linear ranking selection and (elitist) roulette wheel selection) on 59 continuous benchmark test function instances and compare the results.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The plant propagation algorithm is a crossoverless population based evolutionary algorithm, defaultly deploying the plus-selection method for survivor selection - combining parents and offspring population and then selecting the best popSize individuals. In this study, we explore eight different survivor selection methods (plus and comma selection, tournament selection with and without replacement, elitist tournament selection, linear ranking selection and (elitist) roulette wheel selection) on 59 continuous benchmark test function instances and compare the results.
Key concepts: Tournament selection, Fitness proportionate selection, Selection (genetic algorithm), Truncation selection, Benchmark (surveying), Computer science, Population, Tournament