Simulated annealing with an optimal fixed temperature

SIAM Journal on Optimization

Volumn 11, Issue 2, 2000, Pages 289-307

  Fielding, Mark ^a  

^a NONE

Author keywords

Fixed temperatures; Simulated annealing

Indexed keywords

EID: 0034353742     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499363955     Document Type: Article

References (21)

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 J. H. M. KORST, AND P. J. M. VAN LAARHOVEN, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem, J. Statist. Phys., 50 (1988), pp. 187-206.
4. R. E. BURKARD, S. E. KARISCH, AND F. RENDL, QAPLIB - A Quadratic Assignment Problem Library, available online from http://fmatbhp1.tu-graz.ac.at/~karisch/qaplib/
5. V. ČERNÝ, Thermodynamical approach to travelling salesman problem: An efficient simulation algorithm, J. Optim. Theory Appl., 45 (1985), pp. 41-51.
6. H. COHN AND M. FIELDING, Simulated annealing: Searching for an optimal temperature schedule, SIAM J. Optim., 9 (1999), pp. 779-802.
7. D. T. CONNOLLY, An improved annealing scheme for the QAP, European J. Oper. Res., 46 (1990), pp. 93-100.
8. M. GRÖTSCHEL, Polyedrische Charakterisierungen Kombinatorischer Optimie-rungsprobleme, Hain, Meisenheim am Glan, 1977.
9. M. GRÖTSCHEL AND O. HOLLAND, Solution of large-scale symmetric traveling salesman problems, Math. Programming, 51 (1991), pp. 141-202.
10. D. S. JOHNSON, C. R. ARAGON, L. A. MCGEOCH, AND C. SCHEVON, Optimization by simulated annealing: An experimental evaluation; Part 1, Graph Partitioning, Oper. Res., 37 (1989), pp. 865-892.
11. R. L. KARG AND G. L. THOMPSON, A heuristic approach to solving traveling salesman problems, J. Management Sci., 10 (1964), pp. 225-248.
12. S. KIRKPATRICK, C. D. GELLAT, AND M. P. VECCHI, Optimization by simulated annealing, Science, 220 (1983), pp. 671-680.
13. S. KIRKPATRICK, Optimization by simulated annealing: Quantitative studies, J. Statist. Phys., 34 (1983), pp. 975-986.
14. P. D. KROLAK, W. FELTS, AND G. MARBLE, A man-machine approach toward solving the traveling salesman problem, Commun. ACM, 14 (1971), pp. 327-334.
15. S. LIN AND B. W. KERNIGHAN, An effective heuristic algorithm for the traveling salesman problem, J. Oper. Res., 21 (1973), pp. 498-516.
16. C. E. NUGENT, R. F. VOLLMAN, AND J. RUML, An experimental comparison of techniques for the assignment of facilities to locations, Oper. Res., 16 (1968), pp. 150-173.
17. M. PADBERG AND G. RINALDI, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Rev., 33 (1991), pp. 60-100.
18. G. REINELT, TSPLIB - A traveling salesman problem library, ORSA J. Comp., 3 (1991), pp. 376-384. Also available from online http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/ TSPLIB95/TSPLIB.html
19. G. REINELT, TSPLIB, available online from http://www.iwr.uni-heidelberg.de/iwr/comopt/ soft/TSPLIB95/TSPLIB.html
20. J. SKORIN-KAPOV, Tabu search applied to the quadratic assignment problem, ORSA J. Comp., 2 (1990), pp. 33-45.
21. M. R. WILHELM AND T. L. WARD, Solving quadratic assignment problems by simulated annealing, IIE Trans., 19 (1987), pp. 107-119.