Selection Schemes, Elitist Recombination, and Selection Intensity Export

@inproceedings{thierens98elitism, abstract = {Selection algorithms used in evolutionary computation can be characterized according to two features: pure versus elitist selection schemes, and generational versus steadystate selection schemes. Recently the concept of selection intensity has been shown to be a convenient quantitative measure of the selection pressure of pure generational reproduction methods. Here we will discuss how this measure can also be used for elitist and steady-state selection mechanisms. A second goal of the paper is to generalise the Elitist Recombination genetic algorithm such that its selective pressure can be tuned, and to compute the selection intensity of the proposed method. Finally we conclude by computing the selection intensity of a reproductive scheme where both tness biased parent selection and tness biased replacement is used. 1 INTRODUCTION All search algorithms can be characterized by the way they handle the so-called exploitation-exploration tradeo. Exploitation refers to the tendency of ...}, author = {Thierens, Dirk}, booktitle = {Proceedings of the 7th International Conference on Genetic Algorithms}, citeulike-article-id = {5519796}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.236}, keywords = {genetic-algorithm}, pages = {152--159}, posted-at = {2009-08-21 12:36:28}, priority = {2}, title = {Selection Schemes, Elitist Recombination, and Selection Intensity}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.236}, year = {1998} }

TY - CONF ID - thierens98elitism L3 - citeulike-article-id:5519796 N2 - Selection algorithms used in evolutionary computation can be characterized according to two features: pure versus elitist selection schemes, and generational versus steadystate selection schemes. Recently the concept of selection intensity has been shown to be a convenient quantitative measure of the selection pressure of pure generational reproduction methods. Here we will discuss how this measure can also be used for elitist and steady-state selection mechanisms. A second goal of the paper is to generalise the Elitist Recombination genetic algorithm such that its selective pressure can be tuned, and to compute the selection intensity of the proposed method. Finally we conclude by computing the selection intensity of a reproductive scheme where both tness biased parent selection and tness biased replacement is used. 1 INTRODUCTION All search algorithms can be characterized by the way they handle the so-called exploitation-exploration tradeo. Exploitation refers to the tendency of ... EP - 159 TI - Selection Schemes, Elitist Recombination, and Selection Intensity T2 - Proceedings of the 7th International Conference on Genetic Algorithms SP - 152 KW - genetic-algorithm AU - Thierens, Dirk PY - 1998/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.236 ER -