Improved Simulated Annealing Using Momentum Terms

Simulated Annealing is one of the important evolutionary algorithms which can be used in many applications especially in optimization problems. Simulated Annealing has two main phases, the first one is annealing schedule and the second is acceptance probability function. I proposed three annealing schedule methods and one acceptance probability function. The idea of adding momentum terms was used to improve speed and accuracy of annealing schedulers and prevent extreme changes in values of acceptance probability function. Some of my proposed methods show a good accuracy and the others make significant improvement in the speed of simulated Annealing algorithms than the original functions which have been used in the original simulated annealing algorithm.

[1]  H. Szu.  Fast simulated annealing , 1987 .

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

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

[4]  Ehl Emile Aarts,et al.  Statistical cooling : a general approach to combinatorial optimization problems , 1985 .

[5]  Kathryn A. Dowsland.  Modem heuristic techniques for combinatorial problems , 1993 .

[6]  H. Cohn,et al.  Simulated Annealing: Searching for an Optimal Temperature Schedule , 1999, SIAM J. Optim..

[7]  L. Ingber.  Very fast simulated re-annealing , 1989 .

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

[9]  Bruce L. Golden,et al.  Solving the traveling salesman problem with annealing-based heuristics: a computational study , 2002, IEEE Trans. Syst. Man Cybern. Part A.

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

[11]  Luciano Lamberti,et al.  An efficient simulated annealing algorithm for design optimization of truss structures , 2008 .

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

[13]  Eric Vigoda,et al.  Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting , 2007, FOCS.

[14]  Bruce E. Rosen,et al.  Genetic Algorithms and Very Fast Simulated Reannealing: A comparison , 1992 .

[15]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[16]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[17]  C. McDiarmid.  SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .

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