Simulated annealing: A tutorial

Control and Cybernetics

Volumn 25, Issue 1, 1996, Pages

  Pirlot, Marc ^a   Vidal, René Victor Valqui ^b  

^a FACULTÉ POLYTECHNIQUE DE MONS   (Belgium)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Applications; Combinatorial optimization; Simulated annealing

Indexed keywords

EID: 3042916727     PISSN: 03248569     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. AARTS, E. and KORST, J. (1989) Simulated Annealing and Boltzman Machines: a stochastic approach to combinatorial optimization and neural computing. Wiley.
2. ANDERSEN, K. et al. (1993) Design of a teleprocessing communication network using simulated annealing. In: Vidal, R.V.V. (ed.), Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 201-216.
3. AZENCOTT, R. (ed.) (1992) Simulated Annealing. Parallelization Techniques. Wiley.
4. BONOMI, E. and LUTTON, J.L. (1984) The N-city travelling salesman problem: Statistical mechanics and the Metropolis algorithm. SIAM Review, 26, 551-568.
5. ČERNY, V. (1985) A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41-55.
6. CHAMS, M., HERTZ, A. and DE WERRA, D. (1987) Some experiments with simulated annealing for coloring graphs. Eur.J.Op.Res., 32, 260-266.
7. COLLINS, N.E. et al. (1988) Simulated Annealing - an annotated bibliography. AJMMS, 8, 209-507.
8. DEKKERS, A. and AARTS, E. (1991) Global optimization and simulated annealing. Math. Progr., 50, 367-393.
9. DOWSLAND, K.A. (1993) Simulated Annealing. In Reeves, C.R. (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell, Oxford, 20-65.
10. EGLESE, R.W. (1990) Simulated Annealing: a tool for operational research, EJOR, 46, 271-281.
11. FISHER, H. and THOMPSON, G.L. (1963) Probabilistic learning combinations of local job-shop scheduling rules. In Muth, J. and Thompson, G. L. (eds.), Industrial Scheduling, Prentice Hall, Englewood Cliffs, N.J., 225-251.
12. GLOVER, F. and GREENBERG, H.J. (1989) New approaches for heuristic search: a bilateral link with artificial intelligence. EJOR, 39, 119-130.
13. GLOVER, F., TAILLARD, E. and DE WERRA, D. (1993) A user's guide to tabu search. Annals of Operations Research, 41, 3-28.
14. GREEN, J.M. and SUPOWIT, K.J. (1986) Simulated annealing without rejected moves. IEEE Trans. Camputer-Aided Design CAD-5, 221-228.
15. HERTZ, A. and DE WERRA, D. (1987) Using tabu search techniques for graph coloring. Computing, 29, 345-351.
16. HUANG, M.D., ROMEO, F. and SANGIOVANNI-VINCENTELLI, A. (1986) An efficient general cooling schedule for simulated annealing. Proc. IEEE Int. Conf. on CAD (ICCAD 86), 381-384, Santa Clara, Calif.
17. JOHNSON, D.S. et al. (1989) Optimization by Simulated Annealing: an experimental evaluation - Part I (Graph Partitioning). Operations Research, 37, 865-892.
18. JOHNSON, D.S. et al. (1991) Optimization by Simulated Annealing: an experimental evaluation - Part II (Graph Coloring and Number Partitioning). Operations Research, 39, 378-406.
19. KIRKPATRICK, S. et al. (1983) Optimization by Simulated Annealing. Science, 220, 671-680.
20. KOULAMAS, C. et al. (1994) A survey of Simulated Annealing applications to Operations Research problems. Omega, 22, 41-56.
21. LAARHOVEN VAN, P.J.M. and AARTS, E.H.L. (1987) Simulated Annealing: Theory and Applications. Reidel.
22. LAARHOVEN VAN, P.J.M. (1988) Theoretical and Computational Aspects of Simulated Annealing. Centre for Mathematics and Computer Science, Amsterdam.
23. LAM, J. and DELOSME, J. M. (1986) Logic minimization using simulated annealing. Proc. IEEE Int. Conf. on CAD (ICCAD 86), 348-351, Santa Clara, Calif.
24. LIÉGEOIS, B., PIRLOT, M., TEGHEM, J., TRAUWAERT, E., and TUYTTENS, D. (1992) Balanced grouping through simulated annealing. In Vidal, R.V.V. (ed.), Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 275-290.
25. LUNDY, M. and MEES, A. (1986) Convergence of an annealing algorithm, Math. Prog., 34, 111-124.
26. METROPOLIS, N. et al. (1953) Equation of state. Calculation by fast computing machines. Journal of Chem. Phys., 21, 1087-1092.
27. MOSCATO, P. (1993) An introduction to population approaches for optimization and hierarchical objective functions: A discussion of the role of tabu search. Annals of Operations Research, 41, 85-123.
28. OSMAN, I.H. (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41, 421-453.
29. OSMAN, I. H. and CHRISTOFIDES, N. (1994) Capacitated clustering problems by hybrid simulated annealing and tabu search. Int. Trans. Oper. Res., 1, 317-337.
30. OTTEN, R.H.J.M. and VAN GINNEKEN, L.P.P.P. (1990) Annealing Algorithm. Kluwer.
31. PEDERSEN, J.M. (1990) Simulated Annealing and Finite-Time Thermodynamics. Ph.D. Thesis, University of Copenhagen, Denmark.
32. PIRLOT, M. (1993) General Local Search Heuristics in Combinatorial Optimization: a tutorial. Belgian Journal of Operations Research, Statistics and Computer Science, 32, 7-67.
33. ROY, B. and SUSSMANN, B. (1964) Les problèmes d'ordonnancement avec contraintes disjonctives, Note DS 9 bis. SEMA, Paris.
34. SHRAGOWITZ, E. and LIN, R.B. (1990) Combinatorial Optimization by Stochastic Automata, Annals of Operations Research, 22, 293-324.
35. SIARRY, J. and DREYFUS, G. (1989) La méthode du Recuit Simulé (in French), Paris, IDSET.
36. TUYTTENS, D., PIRLOT, M., TEGHEM, J., TRAUWAERT, E. and LIÉGEOIS, B. (1994) Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. Annals of Operations Research, 50, 575-607.
37. VIDAL, R.V.V. (ed.) (1993) Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems. Springer, Berlin.