Dynamics in proportionate selection.

被引:0
|
作者
Agrawal, A [1 ]
Mitchell, I [1 ]
Passmore, P [1 ]
Litovski, I [1 ]
机构
[1] Middlesex Univ, London NW4 4BT, England
关键词
D O I
10.1007/3-211-27389-1_54
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a new selection method for Genetic Algorithms. The motivation behind the proposed method is to investigate the effect of different selection methods on the rate of convergence. The new method Dynamic Selection Method (DSM) is based on proportionate selection. DSM functions by continuously changing the criteria for parent selection (dynamic) based on the number of generations in a run and the current generation. Results show that by using DSM to maintain diversity in a population gives slower convergence, but, their overall performance was an improvement. Relationship between slower convergences, in GA runs, leading to better solutions, has been identified.
引用
收藏
页码:226 / 229
页数:4
相关论文
共 50 条