Competitive Evolution: A Natural Approach to Operator Selection

作者: Q. Tuan Pham

DOI: 10.1007/3-540-60154-6_47

关键词: Selection (genetic algorithm)Improvement ratePopulationArtificial intelligenceMathematical optimizationEngineeringNatural approachSurvival of the fittestOperator (computer programming)

摘要: One of the main problems in applying evolutionary optimisation methods is choice operators and parameter values. This paper propose a competitive evolution method, which several subpopulations are allowed to compete for computer time. The population with fittest members, that highest improvement rate recent past, rewarded.

参考文章(11)
Cezary Z. Janikow, Zbigniew Michalewicz, An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms. international conference on genetic algorithms. pp. 31- 36 ,(1991)
Lawrence Davis, Adapting operator probabilities in genetic algorithms international conference on genetic algorithms. pp. 61- 69 ,(1989)
Richard A. Caruana, J. David Schaffer, Rajarshi Das, Larry J. Eshelman, A study of control parameters affecting online performance of genetic algorithms for function optimization international conference on genetic algorithms. pp. 51- 60 ,(1989)
H. H. Rosenbrock, An Automatic Method for Finding the Greatest or Least Value of a Function The Computer Journal. ,vol. 3, pp. 175- 184 ,(1960) , 10.1093/COMJNL/3.3.175
John Grefenstette, Optimization of Control Parameters for Genetic Algorithms systems man and cybernetics. ,vol. 16, pp. 122- 128 ,(1986) , 10.1109/TSMC.1986.289288
Kenneth Alan De Jong, An analysis of the behavior of a class of genetic adaptive systems. University of Michigan. ,(1975)
G. Rudolph, Convergence analysis of canonical genetic algorithms IEEE Transactions on Neural Networks. ,vol. 5, pp. 96- 101 ,(1994) , 10.1109/72.265964
Lawrence. Davis, Handbook of Genetic Algorithms ,(1991)