A Mushy State Simulated Annealing

It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules or the time schedule itself start. There are several parameters in the process of annealing, the adjustment of which affects the overall performance. This paper focuses on the importance of initial temperature and then proposes a lower temperature with low energy to speed up the process, using an auxiliary memory to buffer the best solution. Such an annealing indeed starts from a “mushy state” rather than a quite liquid molten material. The mushy state characteristics indeed depends upon the problems that SA is being applied to solve for. In this paper, the Mushy State Simulated Annealing (MSSA) is fully developed and then applied to the popular Traveling Salesman Problem (TSP). The mushy state may be obtained by some simple methods like crossover elimination. A very fast version of a Wise Traveling Salesman, who starts from a randomly chosen city and seeks for the nearest one as the next, is also applied to initiate SA by a low-energy, low-temperature state. This fast method results in quite accurate solutions compared to the methods recently cited in the literature.

[1]  A. G. Constantinides,et al.  Speculative parallel simulated annealing with acceptance prediction , 1996 .

[2]  Lipo Wang,et al.  A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Hao Chen,et al.  Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm , 1998, IEEE Trans. Parallel Distributed Syst..

[4]  Yuyao He,et al.  Chaotic simulated annealing with decaying chaotic noise , 2002, IEEE Trans. Neural Networks.

[5]  Shiow-Fen Hwang,et al.  A Novel Intelligent Multiobjective Simulated Annealing Algorithm for Designing Robust PID Controllers , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Yoh-Han Pao,et al.  Combinatorial optimization with use of guided evolutionary simulated annealing , 1995, IEEE Trans. Neural Networks.

[8]  Cheng-Yan Kao,et al.  Applying the genetic approach to simulated annealing in solving some NP-hard problems , 1993, IEEE Trans. Syst. Man Cybern..

[9]  Herbert H. Tsang,et al.  The significance of thermodynamic models in the accuracy improvement of RNA secondary structure prediction using permutation-based simulated annealing , 2007, 2007 IEEE Congress on Evolutionary Computation.

[10]  Tommy W. S. Chow,et al.  Self-Organizing and Self-Evolving Neurons: A New Neural Network for Optimization , 2007, IEEE Transactions on Neural Networks.

[11]  H. Shakouri G.,et al.  Investigation on the choice of the initial temperature in the Simulated Annealing: A mushy state SA for TSP , 2009, 2009 17th Mediterranean Conference on Control and Automation.

[12]  Kwong-Sak Leung,et al.  An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem , 2003, IEEE Trans. Syst. Man Cybern. Part B.

[13]  Hamid Abrishami Moghaddam,et al.  A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[14]  Chris Murphy,et al.  Dominance-Based Multiobjective Simulated Annealing , 2008, IEEE Transactions on Evolutionary Computation.

[15]  Kwong-Sak Leung,et al.  An expanding self-organizing neural network for the traveling salesman problem , 2004, Neurocomputing.

[16]  G. HamedShakouri,et al.  The Wise Experiencing Traveling Salesman (WETS): Introduction to a simple evolutionary solution for the problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[18]  Andrew Sohn,et al.  Parallel N-ary Speculative Computation of Simulated Annealing , 1995, IEEE Trans. Parallel Distributed Syst..

[19]  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.

[20]  B. John Oommen,et al.  A Kohonen-like Decomposition Method for the Traveling Salesman Problem: KNIESDECOMPOSE , 2000, ECAI.

[21]  Derek Pao,et al.  Parallel implementation of simulated annealing using transaction processing , 1999 .

[22]  Kam-Fai Wong,et al.  A genetic algorithm-based clustering approach for database partitioning , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[23]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[24]  Abder Koukam,et al.  A memetic neural network for the Euclidean traveling salesman problem , 2009, Neurocomputing.

[25]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[26]  Griff L. Bilbro,et al.  Sample-sort simulated annealing , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[27]  Hyeonjoong Cho,et al.  Population-oriented simulated annealing technique based on local temperature concept , 1998 .

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

[29]  Rob A. Rutenbar,et al.  Placement by Simulated Annealing on a Multiprocessor , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[30]  B. John Oommen,et al.  A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE , 2003, IEEE Trans. Neural Networks.