Abstract
This paper explores the use of simulated annealing (SA) for solving arbitrary combinatorialoptimisation problems. It reviews an existing code called GPSIMAN for solving0‐1 problems, and evaluates it against a commercial branch‐and‐bound code, OSL. Theproblems tested include travelling salesman, graph colouring, bin packing, quadratic assignmentand generalised assignment. The paper then describes a technique for representingthese problems using arbitrary integer variables, and shows how a general simulated annealingalgorithm can also be applied. This new code, INTSA, outperforms GPSIMAN andOSL on almost all of the problems tested.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Abramson, H. Dang and M. Krishnamoorthy, A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing, Annals of Operations Research 63(1996)129-150.
D. Abramson, A. de Silva, M. Randall and A. Postula, Special purpose computer architectures for high speed optimisation, in: Proceedings of the 2nd Australasian Conference on Parallel and Real Time Systems, 1995, pp 13-20.
D. Abramson, A very high speed architecture to support simulated annealing, IEEE Computer (May, 1992)27-34.
D. Abramson, P. Logothetis, M. Randall and A. Postula, Application specific computers for combinatorial optimisation, in: The Australian Computer Architecture Workshop, Sydney, Feb. 1997.
J. Beasley, OR-library: Distributing test problems by electronic mail, Journal of the Operational Research Society 41(1990)1069-1072.
N. Collins, R. Eglese and B. Golden, Simulated annealing: An annotated bibliography, American Journal of Mathematical and Management Sciences 8(1988)209-307.
D. Connolly, General purpose simulated annealing, Journal of the Operational Research Society 43 (1992)495-505.
R. Eglesse, Simulated Annealing: A tool for operational research, European Journal of Operational Research 46(1990)271-281.
IBM, Optimisation Subroutine Library User Manual, IBM Corporation, 1990.
L. Ingber, Simulated annealing: Practice versus theory, Computer Modelling 18(1993)29-57.
D. Johnson, C. Aragon, L. McGeogh and C. Scheveon, Optimisation by simulated annealing: An experimental evaluation, Part I: Graph partitioning, Operations Research 37 (1991) 865-892.
D. Johnson, C. Aragon, L. McGeogh and C. Scheveon, Optimisation by simulated annealing: An experimental evaluation, Part II: Graph colouring and number partitioning, Operations Research 39(1991)378-406.
S. Kirkpatrick, D. Gelatt and M. Vecchi, Optimization by simulated annealing. Science 220(1983) 671-680.
C. Koulamas, S. Antony and R. Jansen, A survey of simulated annealing to operations research problems, Omega International Journal of Management Science 22(1994)41-56.
E. Lawler, The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimisation, Wiley, 1990.
C. Nugent, T. Vollman and J. Runl, An experimental comparison of techniques for the assignment of facilities to locations, Operations Research 16(1968)150-173.
I. Osman, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, OR Spektrum 17(1995)211-225.
P. Pardalos and H. Wolkowicz, Quadratic assignment problems and related problems, in: Discrete Mathematics and Theoretical Computer Science, Dimacs, 1994.
H. Taha, Operations Research: An Introduction, 5th ed., Macmillan, 1992.
P. van Laarhoven and E. Aarts, Simulated Annealing: Theory and Applications, D. Reidel, 1987.
Rights and permissions
About this article
Cite this article
Abramson, D., Randall, M. A simulated annealing code for general integer linear programs. Annals of Operations Research 86, 3–21 (1999). https://doi.org/10.1023/A:1018915104438
Issue Date:
DOI: https://doi.org/10.1023/A:1018915104438