GENERALIZED SELECTION METHOD

被引：1
|
作者：
Loviskova, Jana [1 ]
Pernecky, Daniel [2 ]
机构：
[1] Slovak Acad Sci, Inst Informat, Dubravska Cesta 9, Bratislava 84507, Slovakia
[2] Slovak Univ Technol Bratislava, Fac Elect Engn & Informat Technol, Ilkovicova 3, Bratislava 81219, Slovakia
来源：
COMPUTING AND INFORMATICS | 2019年 / 38卷 / 06期
关键词：
Selection method; evolutionary algorithm (EA); genetic algorithm (GA); continuous scalability of selection pressure; continuous scalability of randomness; GENETIC ALGORITHMS;
D O I：
10.31577/cai_2019_6_1418
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：1418 / 1443
页数：26
相关论文
共 50 条
12345