论文信息 - Multi-particle Simulated Annealing

Multi-particle Simulated Annealing

Whereas genetic algorithms and evolutionary methods involve a population of points, simulated annealing (SA) can be interpreted as a random walk of a single point inside a feasible set. The sequence of locations visited by SA is a consequence of the Markov Chain Monte Carlo sampler. Instead of running SA with multiple independent runs, in this chapter we study a multi-particle version of simulated annealing in which the population of points interact with each other. We present numerical results that demonstrate the benefits of these interactions on algorithm performance.

[1] Robert L. Smith,et al. Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions , 1984, Oper. Res..

[2] Umesh V. Vazirani,et al. "Go with the winners" algorithms , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3] P. Pokarowski,et al. Tail events of some nonhomogeneous Markov chains , 1995 .

[4] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[5] P. Moral,et al. On the Convergence and the Applications of the Generalized Simulated Annealing , 1999 .

[6] Norman Sadeh,et al. Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing , 1997 .

[7] D. Stroock,et al. Simulated annealing via Sobolev inequalities , 1988 .

[8] Zelda B. Zabinsky,et al. Stochastic Adaptive Search for Global Optimization , 2003 .

[9] M. Locatelli. Simulated Annealing Algorithms for Continuous Global Optimization: Convergence Conditions , 2000 .

[10] Robert L. Smith,et al. Simulated Annealing and Adaptive Search in Global Optimization , 1994, Probability in the Engineering and Informational Sciences.

[11] P. Moral. Feynman-Kac Formulae: Genealogical and Interacting Particle Systems with Applications , 2004 .