Abstract
This paper reports on an attempt to write a general purpose simulated annealing algorithm, capable of finding good solutions to problems expressed as pure 0-1 integer linear programs. Computational results are given to support the claim that the resulting program might be a useful addition to the arsenal of techniques for researchers and practitioners wishing to tackle certain types of large scale 0-1 ILPs.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Connolly, D. General Purpose Simulated Annealing. J Oper Res Soc 43, 495–505 (1992). https://doi.org/10.1057/jors.1992.75
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1992.75