Simulated annealing: Searching for an optimal temperature schedule

SIAM Journal on Optimization

Volumn 9, Issue 3, 1999, Pages 779-802

  Cohn, Harry ^a   Fielding, Mark ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Convergence; Cooling; Fundamental matrix; Inhomogeneous chain; Markov chain; Simulated annealing; Temperature; Time to absorption

Indexed keywords

EID: 0033418030     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497329683     Document Type: Article

References (29)

1. E. H. L. AARTS AND P. J. M. VAN LAARHOVEN, Statistical cooling: A general approach to combinatorial optimization problems, Philips J. Res., 40 (1985), pp. 193-226.
2. E. H. L. AARTS AND P. J. M. VAN LAARHOVEN, Simulated Annealing: Theory and Applications, Reidel, Dordrecht, the Netherlands, 1987.
3. E. H. L AARTS AND J. KORST, Simulated Annealing and Bolzman Machines, John Wiley, New York, 1989.
4. O. BARNDORFF-NIELSEN, On the limit behaviour of extreme order statistics, Ann. Math. Statist., 34 (1963), pp. 992-1002.
5. T. S. CHIANG AND Y. CHOW On the convergence rate of annealing processes, SIAM J. Control Optim., 26 (1988), pp. 1455-1470.
6. H. COHN, On a paper by Doeblin on non-homogeneous Markov chains, Adv. Appl. Prob., 13 (1981), pp. 388-401.
7. H. COHN, On a class of non-homogeneous Markov chains, Math. Proc. Cambridge Philos. Soc., 92 (1982), pp. 527-534.
8. H. COHN, Products of stochastic matrices and applications, Internat. J. Math Math. Sci., 12 (1988), pp. 209-233.
9. D. T. CONNOLLY, An improved annealing scheme for the QAP, European J. Oper. Res., 46 (1990), pp. 93-100.
10. D. P. CONNORS AND P. R. KUMAR, Balance of recurrence order in time-inhomogeneous Markov chains with applications to simulated annealing, Probab. Engrg. Inform. Sci., 2 (1988), pp. 157-184.
11. S. B. GELFAND AND S. K. MITTER, Analysis of simulated annealing for optimization, in Proc. 24th Conference on Decision and Control, Ft. Lauderdale, FL, 1985, pp. 779-786.
12. S. GEMAN AND D. GEMAN, Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images, IEEE Trans. Pattern. Anal. Machine Intelligence, 6 (1984), pp. 721-741.
13. M. GRÖTSCHEL, Polyedrische Charakterisierungen Kombinatorischer Optimierungsprobleme, Hain, Meisenheim am Glan, 1977.
14. M. GRÖTSCHEL AND O. HOLLAND, Solution of large-scale symmetric traveling salesman problems, Math. Programming, 51 (1991), pp. 141-202.
15. B. HAJEK, Cooling schedules for optimal annealing, J. Math. Oper. Res., 13 (1988), pp. 311-329.
16. C. R. HWANG AND S. J. SHEU, Singular perturbed Markov chains and the exact behaviors of simulated annealing processes, J. Theoret. Probab., 5 (1992), pp. 223-249.
17. R. L. KARG AND G. L. THOMPSON, A heuristic approach to solving traveling salesman problems, J. Management Sci., 10 (1964), pp. 225-248.
18. J. G. KEMENY AND J. L. SNELL Finite Markov Chains, Springer-Verlag, New York, 1976.
19. S. KIRKPATRICK, C. D. GELLAT, AND M. P. VECCHI Optimization by simulated annealing, Science, 220 (1983), pp. 671-680.
20. S. KIRKPATRlCK, Optimization by simulated annealing: Quantitative studies, J. Statist. Phys., 34 (1983), pp. 975-986.
21. P. D. KROLAK, W. FELTS, AND G. MARBLE, A man-machine approach toward solving the traveling salesman problem, Comm. ACM, 14 (1971), pp. 327-334.
22. S. LIN AND B. W. KERNIGHAN, An effective heuristic algorithm for the traveling salesman problem, J. Oper. Res., 21 (1973), pp. 498-516.
23. M. LUNDY AND A. MEES Convergence of an annealing algorithm, Math. Programming, 34 (1986), pp. 111-124.
24. N. METROPOLIS, A. W. ROSENBLUTH, M. N. ROSENBLUTH, A. TELLER, AND E. TELLER, Equations of state calculations by fast computing mashines, J. Chem. Phys., 21 (1953), pp. 1087-1092.
25. A. MUKHERJEA, A new result on the convergence of non-homogeneous Markov chains, Trans. Amer. Math. Soc., 90 (1981), pp. 167-182.
26. W. NIEMIRO, Limit distributions of simulated annealing Markov chains, Disc. Math. Algebra Stochastic Methods, 15 (1997), pp. 241-269.
27. W. NIEMIRO AND P. POKAROWSKI, Tail events of some non-homogeneous Markov chains, Ann. Appl. Probab., 5 (1995), pp. 261-293.
28. F. ROMEO AND A. SANGIOVANNI-VINCENTELLI, Probabilistic hill climbing algorithms: Properties and applications, Proc. Chapel Hill Conference on VLSI, H. Fuchs, ed., Computer Science Press, Rockville, MD, 1985, pp. 393-417.
29. E. SENETA, Non-Negative Matrices and Markov Chains, Springer-Verlag, New York, 1981.