A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems

Abstract We propose a method for determining the starting temperature in two-stage simulated annealing systems utilizing traditional homogeneous temperature schedules. While most previous work in this area has focused on ad hoc experimentally derived constant starting temperatures for the low-temperature annealing phase, this investigation presents a method for generalized starting temperature determination for the aforementioned class of two-stage simulated annealing systems. We have tested our method on three NP-hard optimization problems using both classic and adaptive homogeneous cooling schedules. The experimental results have been consistently very good – on average the running time is halved when using an adaptive cooling schedule and reduced by a third in the case of the classic schedule – with no average loss in solution quality. Scope and purpose The homogeneous simulated annealing algorithm is a general-purpose optimization paradigm that has proven to be quite effective for finding high-quality solutions to a diverse range of NP-hard combinatorial optimization problems. These types of problems are quite common in the field of operations research, and indeed simulated annealing has been used quite extensively to produce high-quality solutions to many of these problems. Two common examples are the graph partitioning problem and the traveling salesperson problem. Although the efficacy and robustness of the simulated annealing heuristic has been thoroughly demonstrated in the literature, the main drawback to the algorithm is its sometimes prohibitive run times. Two-stage simulated annealing is a technique introduced in the literature as a method for decreasing the run times of simulated annealing while maintaining its exceptional solution quality for many problems. The main drawback to the two-stage simulated annealing technique is its problem- and formulation-dependent nature. To date, an effective general method for determining the starting temperature in two-stage simulated annealing systems that is fast and both problem- and formulation-independent has yet to be demonstrated. This investigation presents such a method.

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

[2]  Pedersen,et al.  Monte Carlo dynamics of optimization problems: A scaling description. , 1990, Physical review. A, Atomic, molecular, and optical physics.

[3]  George B. Dantzig,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..

[4]  B. Hajek,et al.  Simulated annealing—to cool or not , 1989 .

[5]  Jean-Marc Delosme,et al.  Simulated annealing: a fast heuristic for some generic layout problems , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

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

[7]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[8]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[9]  Lov K. Grover Standard Cell Placement Using Simulated Sintering , 1987, 24th ACM/IEEE Design Automation Conference.

[10]  Jonathan Rose,et al.  Parallel standard cell placement algorithms with quality equivalent to simulated annealing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Emile H. L. Aarts,et al.  A new polynomial time cooling schedule , 1985 .

[12]  Bruce Hajek,et al.  A tutorial survey of theory and applications of simulated annealing , 1985, 1985 24th IEEE Conference on Decision and Control.

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

[14]  Jonathan Rose,et al.  Temperature measurement and equilibrium dynamics of simulated annealing placements , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[16]  Bryan Preas Benchmarks for cell-based layout systems , 1987, DAC '87.

[17]  Jean-Marc Delosme,et al.  Performance of a new annealing schedule , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[18]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[19]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[20]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

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

[22]  A. Kahng,et al.  Best-so-far vs. where-you-are: implications for optimal finite-time annealing , 1994 .

[23]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  R. H. J. M. Otten,et al.  The Annealing Algorithm , 1989 .

[25]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[26]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[27]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

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

[29]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[30]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[31]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[32]  D. F. Wong,et al.  Simulated Annealing for VLSI Design , 1988 .

[33]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[34]  Catherine A. Schevon,et al.  Optimization by simulated annealing: An experimental evaluation , 1984 .