A simulated annealing code for general integer linear programs

D. Abramson and M. Randall

Annals of Operations Research, 1999, vol. 86, issue 0, 3-21

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. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018915104438 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:86:y:1999:i:0:p:3-21:10.1023/a:1018915104438

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018915104438

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().