Multistage extremal optimization for hard travelling salesman problem

The adjustable parameters of probability distributions adopted by extremal optimization (EO) and its modified versions play a critical role in controlling their performances. Unlike the traditional static probability distribution based strategy, this paper presents a novel method called multistage EO to explore the configuration space of hard travelling salesman problem (TSP) by using different values of the parameters in different stages. This method is to optimize with multi-start techniques starting from random states in the first stage. In all later stages, it always selects the best configuration obtained from the last stage as the initial one for optimization in the current stage. The superior performance of the proposed method is proved by the experimental tests with the well-known hard TSP instances.

[1]  A. Percus,et al.  Nature's Way of Optimizing , 1999, Artif. Intell..

[2]  Min-Rong Chen,et al.  Multiobjective optimization using population-based extremal optimization , 2008, Neural Computing and Applications.

[3]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[4]  A. Hartmann.  Phase Transitions in Combinatorial Optimization Problems - Basics, Algorithms and Statistical Mechanics , 2005 .

[5]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[6]  Bak,et al.  Punctuated equilibrium and criticality in a simple model of evolution. , 1993, Physical review letters.

[7]  Karl Heinz Hoffmann,et al.  Fitness threshold accepting over extremal optimization ranks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Faster Monte Carlo simulations at low temperatures. The waiting time method , 2001, cond-mat/0107475.

[9]  Yong Chen,et al.  Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution , 2006, cond-mat/0603237.

[10]  C. Tsallis.  Possible generalization of Boltzmann-Gibbs statistics , 1988 .

[11]  Weijie Mao,et al.  Study on probability distributions for evolution in modified extremal optimization , 2010 .

[12]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[13]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[14]  Min-Rong Chen,et al.  A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization , 2008, Eur. J. Oper. Res..

[15]  A. Mobius,et al.  COMBINATORIAL OPTIMIZATION BY ITERATIVE PARTIAL TRANSCRIPTION , 1999, cond-mat/9902034.

[16]  Stephan Mertens.  Computational complexity for physicists , 2002, Comput. Sci. Eng..

[17]  Weijie Mao,et al.  A novel stochastic method with modified extremal optimization and nearest neighbor search for hard combinatorial problems , 2010, 2010 8th World Congress on Intelligent Control and Automation.

[18]  Rémi Monasson,et al.  A review of the Statistical Mechanics approach to Random Optimization Problems , 2008, ArXiv.

[19]  Hector J. Levesque,et al.  Generating Hard Satisfiability Problems , 1996, Artif. Intell..

[20]  Guoqiang Zeng,et al.  Survey on computational complexity with phase transitions and extremal optimization , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[21]  Stefan Boettcher,et al.  Extremal Optimization: Methods derived from Co-Evolution , 1999, GECCO.

[22]  Stefan Boettcher,et al.  Extremal optimization at the phase transition of the three-coloring problem. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Bart Selman,et al.  Computational science: A hard statistical view , 2008, Nature.

[24]  Yu-Wang Chen,et al.  Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling , 2008 .

[25]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[26]  A. Middleton,et al.  Improved extremal optimization for the Ising spin glass. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[28]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[29]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[30]  J. M. Singer,et al.  Searching for backbones — an efficient parallel algorithm for the traveling salesman problem , 1996 .

[31]  Johannes Schneider,et al.  Searching for Backbones--a high-performance parallel algorithm for solving combinatorial optimization problems , 2003, Future Gener. Comput. Syst..

[32]  Tang,et al.  Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .

[33]  Karl Heinz Hoffmann,et al.  Simulated annealing with Threshold Accepting or Tsallis statistics , 2000 .

[34]  William M. Springer.  Review of the traveling salesman problem: a computational study by Applegate, Bixby, Chvátal, and Cook (Princeton University Press) , 2009, SIGA.

[35]  Kay Hamacher,et al.  Adaptive extremal optimization by detrended fluctuation analysis , 2007, J. Comput. Phys..

[36]  Stefan Boettcher,et al.  Extremal Optimization for Graph Partitioning , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[37]  A. Mobius,et al.  OPTIMIZATION BY THERMAL CYCLING , 1997, cond-mat/0502241.

[38]  Tao Zhou,et al.  Continuous extremal optimization for Lennard-Jones clusters. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Peng Chen,et al.  Optimization with extremal dynamics for the traveling salesman problem , 2007 .

[40]  Penna,et al.  Traveling salesman problem and Tsallis statistics. , 1995, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[41]  Karl Heinz Hoffmann,et al.  Best possible probability distribution over extremal optimization ranks , 2004 .