Convergence in Simulated Evolution Algorithms.
作者： Olivier François
DOI:
关键词: Applied mathematics 、 Convergence (routing) 、 Computer science
摘要:
参考文章(12)
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)
John H. Holland, Adaptation in natural and artificial systems ,(1992)
David E. Goldberg, Genetic algorithms in search, optimization, and machine learning ,(1988)
Olivier Catoni, Rough Large Deviation Estimates for Simulated Annealing: Application to Exponential Schedules Annals of Probability. ,vol. 20, pp. 1109- 1146 ,(1992) , 10.1214/AOP/1176989682
David B. Fogel, Evolutionary Computation: Towards a New Philosophy of Machine Intelligence IEEE Press. ,(1995)
Mark I. Freidlin, Alexander D. Wentzell, Random Perturbations of Dynamical Systems ,(1998)
John N. Tsitsiklis, Markov Chains with Rare Transitions and Simulated Annealing Mathematics of Operations Research. ,vol. 14, pp. 70- 90 ,(1989) , 10.1287/MOOR.14.1.70
Alain Trouvé, Cycle Decompositions and Simulated Annealing Siam Journal on Control and Optimization. ,vol. 34, pp. 966- 986 ,(1996) , 10.1137/S0363012993258586
Thomas Back, Evolutionary algorithms in theory and practice ,(1996)
P. J. M. Laarhoven, E. H. L. Aarts, Simulated Annealing: Theory and Applications ,(1987)