论文信息 - General Purpose Simulated Annealing

General Purpose Simulated Annealing

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.

David Connolly | David Connolly

[1] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..

[2] N. E. Collins,et al. Simulated annealing - an annotated bibliography , 1988 .

[3] David Connolly. An improved annealing scheme for the QAP , 1990 .

[4] Thomas E. Vollmann,et al. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[5] Richard W. Eglese,et al. Conference Seminar Timetabling , 1987 .

[6] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .

[7] Stella Sofianopoulou,et al. The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches , 1992 .