Abstract
In this paper we introduce new selection method, 3-selection method. This method tries to generalize the most used selection methods in Genetic Algorithms (GA). Our new method involves both proportional and rank-based methods (order-based) and, moreover, it allows scaling of selection pressure with higher precision. This method is based on defining the shape of probability density distribution which is adjustable by parameters of our method. In addition, our method has one more attribute which adds randomness of selection.
Keywords
- Selection method
- evolutionary algorithm (EA)
- genetic algorithm (GA)
- continuous scalability of selection pressure
- continuous scalability of randomness
MSC
97R40
Cite this article
@article{cai-3972,
author = {Jana Lovíšková and Daniel Pernecký},
title = {Generalized Selection Method},
journal = {Computing and Informatics},
volume = {38},
number = {6},
pages = {1418--1443},
year = {2019},
issn = {1335-9150},
doi = {10.31577/cai_2019_6_1418}
}
TY - JOUR AU - Jana Lovíšková AU - Daniel Pernecký TI - Generalized Selection Method JO - Computing and Informatics VL - 38 IS - 6 SP - 1418 EP - 1443 PY - 2019 SN - 1335-9150 DO - 10.31577/cai_2019_6_1418 UR - https://doi.org/10.31577/cai_2019_6_1418 KW - Selection method KW - evolutionary algorithm (EA) KW - genetic algorithm (GA) KW - continuous scalability of selection pressure KW - continuous scalability of randomness ER -
Lovíšková, J., & Pernecký, D. (2019). Generalized Selection Method. Computing and Informatics, 38(6), 1418–1443. https://doi.org/10.31577/cai_2019_6_1418