Large deviations, evolutionary computation and comparisons of algorithms

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

Volumn 1917, Issue , 2000, Pages 79-88

  François, Olivier ^a  

^a Laboratoire de Modelisation et Calcul   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

GEOMETRIC QUANTITIES; LARGE DEVIATIONS; PARALLEL SIMULATED ANNEALING; STOCHASTIC OPTIMIZATION ALGORITHM;

SIMULATED ANNEALING;

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

References (16)

1. E.H.L Aarts and J.H.M Korst. Simulated annealing and Boltzmann machines, Wiley, New York, 1988.
2. O. Catoni. Rough large deviation estimates for simulated annealing: Application to exponential schedules. Ann. Probab., 20 (1991), 3, 1109-1146.
3. R. Cerf. The dynamics of mutation-selection algorithms with large population sizes. Ann. Inst. H. Poincaré Probab. Statist., 32 (1996), 455-508.
4. T.E. Davis and J.C. Principe. A simulated annealing like convergence theory for the simple genetic algorithm. In R.K. Belew and L.B. Booker eds. Proceedings of the fourth Int. Conf. on Genetic Algorithms, San Mateo CA, Morgan Kauffman, 174-181, 1991.
5. O. François. An evolutionary strategy for global minimization and its Markov chain analysis, IEEE Transactions on Evolutionary Computation, 2, (1998), 77-90.
6. O. François. Global optimization with exploration/selection algorithms and simulated annealing, Preprint, (2000).
7. M.Ï. Freidlin and A.D. Wentzell. Random perturbations of dynamical systems, Springer Verlag, New York, 1984.
8. B. Hajek. Cooling schedules for optimal annealing, Math. Oper. Res, 13 (1988), 311-329.
9. S.W. Mahfoud and D.E. Golberg. Parallel recombinative simulated annealing: A genetic algorithm. Parallel Computing, 21 (1995),1,1995.
10. E. Van Nimwegen, J.P. Crutchfield and M. Mitchell. Statistical dynamics of the royal road genetic algorithm. Theor. Comput. Sci., 229 (1999), 41-102.
11. G. Rudolph. Massively parallel simulated annealing and its relation to evolutionary algorithms, Evolutionary Computation, 1, 4, (1993), 361-383.
12. G. Rudolph. Finite Markov chain results in evolutionary computation: A tour d'horizon, Fundamenta Informaticae, (1998), 1-22.
13. J. Suzuki. A further result on the Markov chain model of genetic algorithm and its application to a simulated annealing-like theory, IEEE Trans. Systems, Man, and Cybernetics-B, 28,1 (1998), 95-102.
14. A. Trouvé. Asymptotical behaviour of several interacting annealing processes, Probab. Theory Related Fields, 102 (1995), 123-143.
15. A. Trouvé. Cycle decomposition and simulated annealing, SI AM J. Control Optim., 34, 3 (1996), 966-986.
16. J.N. Tsitsiklis. Markov chains with rare transitions and simulated annealing, Math. Oper. Res., 14 (1989) 70-90.