TY - JOUR
T1 - A simulated annealing code for general integer linear programs
AU - Abramson, David
AU - Randall, Marcus
PY - 1999/12/1
Y1 - 1999/12/1
N2 - This paper explores the use of simulated annealing (SA) for solving arbitrary combinatorial optimisation problems. It reviews an existing code called GPSIMAN for solving 0-1 problems, and evaluates it against a commercial branch-and-bound code, OSL. The problems tested include travelling salesman, graph colouring, bin packing, quadratic assignment and generalised assignment. The paper then describes a technique for representing these problems using arbitrary integer variables, and shows how a general simulated annealing algorithm can also be applied. This new code, INTSA, outperforms GPSIMAN and OSL on almost all of the problems tested.
AB - This paper explores the use of simulated annealing (SA) for solving arbitrary combinatorial optimisation problems. It reviews an existing code called GPSIMAN for solving 0-1 problems, and evaluates it against a commercial branch-and-bound code, OSL. The problems tested include travelling salesman, graph colouring, bin packing, quadratic assignment and generalised assignment. The paper then describes a technique for representing these problems using arbitrary integer variables, and shows how a general simulated annealing algorithm can also be applied. This new code, INTSA, outperforms GPSIMAN and OSL on almost all of the problems tested.
UR - http://www.scopus.com/inward/record.url?scp=0033450364&partnerID=8YFLogxK
U2 - 10.1023/A:1018915104438
DO - 10.1023/A:1018915104438
M3 - Article
AN - SCOPUS:0033450364
SN - 0254-5330
VL - 86
SP - 3
EP - 21
JO - Annals of Operations Research
JF - Annals of Operations Research
ER -