Simulated Annealing and Combinatorial Optimization

We formulate a class of adaptive heuristics for combinatorial optimization. Recently proposed methods such as simulated annealing, probabilistic hill climbing, and sequence heuristics, as well as classical perturbation methods are all members of this class of adaptive heuristics. We expose the issues involved in using an adaptive heuristic in general, and simulated annealing, probabilistic hill climbing, and sequence heuristics in particular. These issues are investigated experimentally.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[3]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4]  Shigeki Goto,et al.  Suboptimum solution of the back-board ordering with channel capacity constraint , 1977 .

[5]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[6]  Sartaj Sahni,et al.  The Complexity of Design Automation Problems , 1980, 17th Design Automation Conference.

[7]  Sartaj Sahni,et al.  Heuristics for the Circuit Realization Problem , 1983, 20th Design Automation Conference Proceedings.

[8]  Scott Kirkpatrick,et al.  Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Sungho Kang,et al.  Linear Ordering and Application to Placement , 1983, 20th Design Automation Conference Proceedings.

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Sartaj Sahni,et al.  The complexity of single row routing , 1984 .

[12]  Sartaj Sahni.  Software Development in Pascal , 1985 .

[13]  D. Mitra,et al.  Convergence and finite-time behavior of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.

[14]  Sartaj Sahni,et al.  Experiments with Simulated Annealing , 1985, DAC 1985.

[15]  A. Sangiovanni-Vincentelli,et al.  The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.

[16]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[17]  Kenneth J. Supowit,et al.  Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  S. Sahni,et al.  Optional linear arrangement of circuit components , 1987 .