Simulated annealing, weighted simulated annnealing and genetic algorithm at work

Computational Statistics

Volumn 12, Issue 4, 1997, Pages 447-465

  Bergeret, François ^a   Besse, Philippe ^b  

^a MOTOROLA INC   (United States)

^b CNRS   (France)

Author keywords

Design of experiment; Quality control; Stochastic optimization

Indexed keywords

EID: 0040055865     PISSN: 09434062     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. Aarst E. and Korst J. (1989), Simulated Annealing and Boltzmann machines, Wiley and sons.
2. d, J. Applied Probability, 29, 885-895.
3. Bergeret F. and Chandon Y. (1995), Recherche d'une séquence de test optimale en contrôle de fabrication, Revue de Statistique Appliquée, XLIII, 3, 21-33.
4. Catoni O. (1991), Sharp large deviations estimates for simulated annealing algorithms, Annales de l'Institut Henri Poincaré, 27, 3, 291-383.
5. Catoni O. (1992), Rates of convergence for sequential annealing: a large deviation approach, in: R. Azencott Ed., Simulated Annealing: parallelizatton techniques, Wiley and sons, 25-35.
6. Cerf R. (1994), Une théorie asymptotique des algorithmes génétiques, Thèse de Doctorat, Université Montpellier 2.
7. Chiang T.S. and Chow Y. (1988), On the convergence rate of annealing processes, Siam J. Control Optimization, 26, No 6.
8. Davis L. (1987), Genetic Algorithms and Simulated Annealing. Pitman, London.
9. Davis L. (1991), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York.
10. Efron B. (1979), Bootstrap methods : another look at the jackknife, Ann. Stat., 7, 1-26.
11. Geman S. and Geman D. (1984), Stochastic relaxation, Gibbs distribution, and the Bayesian restauration of images. Institute of Electrical and Electronics Engineers. Transactions on Pattern Analysis and Machine Intelligence, 6, 721-741.
12. Gidas B. (1985), Non stationary Markov chains and convergence of the annealing algorithm, Journal of Statistical Physics, 39, 73-131.
13. Hajek B. (1985), A tutorial survey of theory and applications of simulated annealing, IEEE Conference on Decision and Control.
14. Hajek B. (1988), Cooling schedule for optimal annealing, Mathematics of Operations Research, 13, 311-329.
15. Holland J. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
16. Hwang C.R. and Sheu S.J. (1992), Singular perturbed Markov chains and exact behaviors of simulated annealing processes, Journal of Theoretical Probability, 5, 223-249.
17. Isaacson D. and Madsen R. (1976), Markov Chains, Wiley.
18. Kirkpatrick S., Gellat C. and Vecchi M. (1983), Optimization by simulated annealing, Science, 220, 671-679.
19. Miclo L. (1996), Remarques sur l'hypercontractivité et l'évolution de l'entropie pour les chaínes de Markov finies, to appear in J. Azéma P.A. Meyer, and M. Yor editors, Seminaire de probabilité. Lecture notes in Mathematics, Springer Verlag.
20. Park K. and Carter B. (1995), On the effectiveness of genetic search m combinatorial optimization, in Proc. 10th ACM Symposium on Applied Computing, Genetic Algorithms and Optimization Track.
21. Trouvé A. (1993) Parallélisation massive du recuit simulé, Thèse de doctorat, Université Paris XI.
22. Tsitsiklis J.N. (1989), Markov chains with rare transitions and simulated annealing, Math. Op. Res, 14, 1.