Perturbation theory for evolutionary algorithms: Towards an estimation of convergence speed

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1917, Issue , 2000, Pages 109-118

  Landrin Schweitzer, Yann ^a   Lutton, Evelyne ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

CONTINUOUS SPACES; CONVERGENCE SPEED; FITNESS FUNCTIONS; PERTURBATION THEORY; SOJOURN TIME; STATISTICAL MEASURES;

PERTURBATION TECHNIQUES;

EID: 84947905504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_11     Document Type: Conference Paper

References (15)

1. M. I. Freidlin, A. D. Wentzell, "Random perturbations of dynamical systems." Trad, de: "Fluktuatsii u Dinamicheskikh Sistemakh Pod Deistviem Malykh Sluchainykh Vozmushchenii". Springer, 1984.
2. M. Jerrum, "Mathematical Foundations of the Markov Chain Monte Carlo Method'. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, B. Reed (Eds.), Probabilistic Methods for Algorithmic Discrete Mathematics, Springer Verlag, 1998.
3. E. Aarts and P. Van Laarhoven, "Simulated annealing: a pedestrian review of the theory and some applications". NATO, ASI Series, Vol. F30, Springer Verlag.
4. E. Lutton and J. Lévy Véhel, Some remarks on the optimization of Holder functions with Genetic Algorithms, IEEE trans on Evolutionary computing, 1998, see also Inria Research Report No 2627.
5. 5 B. Leblanc, and E. Lutton. Bitwise Regularity Coefficients as a Tool for Deception Analysis of a Genetic Algorithm, 1997, INRIA research report, RR-3274.
6. 6 A. Agapie. Genetic algorithms: Minimal conditions for convergence. In Artificial Evolution, European Conference, AE 97, Nimes, France, October 1997,. Springer Verlag, 1997.
7. Lee Altenberg. The Schema Theorem and Price's Theorem. In Foundation of Genetic Algorithms 3, 1995. ed. Darrell Whitley and Michael Vose. pp. 23-49. Morgan Kaufmann, San Francisco.
8. R. Cerf. Artificial Evolution, European Conference, AE 95, Brest, France, September 1995, Selected papers, volume Lecture Notes in Computer Science 1063, chapter Asymptotic convergence of genetic algorithms, pages 37-54. Springer Verlag, 1995.
9. Thomas E. Davis and Jose C. Principe. A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm. In Proceedings of the Fourth International Conference on Genetic Algorithm, pages 174-182, 1991. 13-16 July.
10. O. François. An Evolutionary Strategy for Global Minimization and its Markov Cham Analysis. IEEE transactions on evolutionary computation, septembre 1998
11. Evelyne Lutton. Genetic Algorithms and Fractals. In Evolutionary Algorithms in Engineering and Computer Science, K. Mietttinen, M. M. Mäkelä, P. Neittaan-maki, J. Périaux, Eds, John Wiley & Sons, 1999.
12. G. Rudolph. Asymptotical convergence rates of simple evolutionary algorithms under factorizing mutation distributions. In Artificial Evolution, European Conference, AE 97, Nimes. France, October 1997,. Springer Verlag, 1997.
13. A. Trouvé, Rough large deviation estimates for the optimal convergence speed exponent of generalized simulated annealing algorithms. 1993
14. M.D. Vose. Formalizing genetic algorithms. In Genetic Algorithms, Neural Networks and Simulated Annealing Applied to Problems in Signal and Image processing. The institute of Electrical and Electronics Engineers Inc., 8th-9th May 1990. Kelvin Conference Centre, University of Glasgow.
15. Y. Landrin-Schweitzer, E. Lutton. Perturbation theory for Evolutionary Algorithms. Inria Research Report, 2000.