An evolutionary strategy for global minimization and its Markov chain analysis

作者: O. Francois

DOI: 10.1109/4235.735430

关键词:

摘要: The mutation-or-selection evolutionary strategy (MOSES) is presented. goal of this to solve complex discrete optimization problems. MOSES evolves a constant sized population labeled solutions. dynamics employ mechanisms mutation and selection. At each generation, the best solution selected from current population. A random binomial variable N which represents number offspring by sampled. Therefore first solutions are replaced offspring, other replicas solution. relationships between convergence, parameters strategy, geometry problem theoretically studied. As result, explicit parametrizations proposed.

参考文章(22)
José Carlos Príncipe, Thomas E. Davis, A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm international conference on genetic algorithms. pp. 174- 181 ,(1991)
Raphaël Cerf, The dynamics of mutation-selection algorithms with large population sizes Annales De L Institut Henri Poincare-probabilites Et Statistiques. ,vol. 32, pp. 455- 508 ,(1996)
Joe Suzuki, A Markov Chain Analysis on A Genetic Algorithm international conference on genetic algorithms. pp. 146- 154 ,(1993)
Raphaël Cerf, Une théorie asymptotique des algorithmes génétiques Montpellier 2. ,(1994)
Michael D. Vose, A closer look at mutation in genetic algorithms Annals of Mathematics and Artificial Intelligence. ,vol. 10, pp. 423- 434 ,(1994) , 10.1007/BF01531279
Allen E. Nix, Michael D. Vose, Modeling genetic algorithms with Markov chains Annals of Mathematics and Artificial Intelligence. ,vol. 5, pp. 79- 88 ,(1992) , 10.1007/BF01530781
Bruce Hajek, Cooling Schedules for Optimal Annealing Mathematics of Operations Research. ,vol. 13, pp. 311- 329 ,(1988) , 10.1287/MOOR.13.2.311
Uday Kumar Chakraborty, Kalyanmoy Deb, Mandira Chakraborty, Analysis of selection algorithms: A markov chain approach Evolutionary Computation. ,vol. 4, pp. 133- 167 ,(1996) , 10.1162/EVCO.1996.4.2.133