Simulated annealing

Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques

Volumn , Issue , 2005, Pages 187-210

  Aarts, Emile ^a,b   Korst, Jan ^a   Michiels, Wil ^a,b  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892111455     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-28356-0_7     Document Type: Chapter

References (47)

1. Aarts, E. H. L. and Korst, J. H. M., 1989, Simulated Annealing and Boltzmann Machines, Wiley, Chichester.
2. Aarts, E. H. L. and Van Laarhoven, P. J. M., 1985, Statistical cooling: a general approach to combinatorial optimization problems, Philips J. Res. 40:193-226.
3. Aarts, E. H. L., Korst, J. H. M. and Van Laarhoven, P. J. M., 1988, A quantitative analysis of the simulated annealing algorithm: a case study for the traveling salesman problem, J. Statist. Phys. 50:189-206.
4. Aarts, E. H. L. and Lenstra, J. K., eds, 2003, Local Search in Combinatorial Optimization, Princeton University Press, Princeton, NJ.
5. Andersen, B., 1996, Finite-time thermodynamics and simulated annealing, in: Entropy and Entropy Generation, J. S. Shiner, ed., Kluwer, Dordrecht, pp. 111-127.
6. Anily, S. and Federgruen, A., 1987, Simulated annealing methods with general acceptance probabilities, J. Appl. Probab. 24:657-667.
7. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A. and Protasi, M., 1999, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer, Berlin.
8. Azencott, R., 1992, Simulated Annealing: Parallelization Techniques, Wiley, Chichester.
9. Binder, K., 1978, Monte Carlo Methods in Statistical Physics, Springer, Berlin.
10. Cerny, V., 1985, Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, J. Optim. Theory Appl. 45:41-51.
11. Collins, N. E., Eglese, R. W. and Golden, B. L., 1988, Simulated annealing: An annotated bibliography, Am. J. Math. Manage. Sci. 8:209-307.
12. Connors, D. P. and Kumar, P. R., 1987, Simulated annealing and balance of recurrence order in time-inhomogeneous Markov chains, in: Proc. 26th IEEE Conf. on Decision and Control, pp. 2261-2263.
13. Eglese, R. W., 1990, Simulated annealing: a tool for operational research, Eur. J. Oper. Res. 46:271-281.
14. Feller, W., 1950, An Introduction to Probability Theory and Its Applications I, Wiley, New York.
15. Fox, B. L., 1993, Integrating and accelerating tabu search, simulated annealing, and genetic algorithms, in: Tabu Search, Annals of Operations Research, Vol. 41, F. Glover, E. Taillard, M. Laguna, and D. de Werra, eds, Baltzer, Basel, pp. 47-67.
16. Garey, M. R. and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco.
17. Gidas, B., 1985, Nonstationary Markov chains and convergence of the annealing algorithm, J. Statist. Phys. 39:73-131.
18. Hajek, B., 1985, A tutorial survey of the theory and application of simulated annealing, in: Proc. 24th IEEE Conf. on Decision and Control, pp. 755-760.
19. Hajek, B., 1988, Cooling schedules for optimal annealing, Math. Oper. Res. 13:311-329.
20. Isaacson, D. and Madsen, R., 1976, Markov Chains, Wiley, New York.
21. Johnson, D. S., Aragon, C. R., McGeoch, L. A. and Schevon, C, 1989, Optimization by simulated annealing: an experimental evaluation. I: graph partitioning, Oper. Res. 37:865-892.
22. Johnson, D. S., Aragon, C. R., McGeoch, L. A. and Schevon, C, 1991, Optimization by simulated annealing: an experimental evaluation. II: graph coloring and number partitioning, Oper. Res. 39:378-406.
23. Kernighan, B. W. and Lin, S., 1970, An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J. 49:291-307.
24. Kirkpatrick, S., Gelatt Jr, C. D. and Vecchi, M. P., 1983, Optimization by simulated annealing, Science 220:671-680.
25. Korst, J. H. M. and Aarts, E. H. L., 1989, Combinatorial optimization on a Boltzmann machine, J. Parallel Distrib. Comput. 6:331-357.
26. Van Laarhoven, P. J. M., 1988, Theoretical and Computational Aspects of Simulated Annealing, Ph. D. Thesis, Erasmus University, Rotterdam.
27. Van Laarhoven, P. J. M. and Aarts, E. H. L., 1987, Simulated Annealing: Theory and Applications, Reidel, Dordrecht.
28. Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K., 1992, Job shop scheduling by simulated annealing, Open Res. 40:185-201.
29. Van Laarhoven, P. J. M., Aarts, E. H. L., Van Lint, J. H. and Wille, L. T., 1989, New upper bounds for the football pool problem for 6, 7 and 8 matches, J. Combinat. Theor. A 52:304-312.
30. Lam, J. and Delosme, J.-M., 1986, Logic minimization using simulated annealing, in: Proc. IEEE Int. Conf. on Computer-Aided Design, pp. 348-351.
31. Lin, S., 1965, Computer solutions of the traveling salesman problem, Bell Syst. Tech. J. 44:2245-2269.
32. Lin, S. and Kernighan, B. W., 1973, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21:498-516.
33. Lundy, M. and Mees, A., 1986, Convergence of an annealing algorithm, Math. Programm. 34:111-124.
34. Metropolis, M., Rosenbluth, A., Rosenbluth, M., Teller, A. and Teller, E., 1953, Equation of state calculations by fast computing machines, J. Chem. Phys. 21:1087-1092.
35. Mitra, D., Romeo, F. and Sangiovanni-Vincentelli, A. L., 1986, Convergence and finite-time behavior of simulated annealing, Adv. Appl. Probab. 18:747-771.
36. Nourani, Y. and Andersen, B., 1998, A comparison of simulated annealing cooling strategies, J. Phys. A 31:8373-8385.
37. Orosz, J. E. and Jacobson, S. H., 2002, Finite-time performance analysis of static simulated annealing algorithms, Comput. Optim. Appl. 21:21-53.
38. Papadimitriou, C. H. and Steiglitz, K., 1982, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, New York.
39. Park, M.-W. and Kim, Y.-D., 1998, A systematic procedure for setting parameters in simulated annealing algorithms, Comput. Oper. Res. 25:207-217.
40. Romeo, F. and Sangiovanni-Vincentelli, A., 1991, A theoretical framework for simulated annealing, Algorithmica 6:302-345.
41. Salamon, P., Sibani, P. and Frost, R., 2002, Facts, Conjectures, and Improvements for Simulated Annealing, SIAM Monographs.
42. Sechen, C. and Sangiovanni-Vincentelli, A. L., 1985, The Timber-Wolf placement and routing package, IEEE J. Solid-State Circuits 30:510-522.
43. Seneta, E., 1981, Non-negative Matrices and Markov Chains, 2nd edn, Springer, New York.
44. Steinhofel, K., Albrecht, A. and Wong, C. K., 1998, On various cooling schedules for simulated annealing applied to the job shop problem, in: Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computing Science, Vol. 1518, M. Luby, J. Rolim, and M. Serna, eds, pp. 260-279.
45. Strenski, P. N. and Kirkpatrick, S., 1991, Analysis of finite length annealing schedules, Algorithmica 6:346-366.
46. Vidal, R. V. V., ed., 1993, Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, Vol. 396, Springer, Berlin.
47. White, S. R., 1984, Concepts of scale in simulated annealing, in: Proc. IEEE Int. Conf. on Computer Design (Port Chester), pp. 646-651.