Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem

Simulated annealing SA algorithm is a popular intelligent optimisation algorithm, but its efficiency is unsatisfactory. To improve its efficiency, this paper presents a swarm SA SSA algorithm by exploiting the learned knowledge from searching history. In SSA, a swarm of individuals run SA algorithm collaboratively. Inspired by ant colony optimisation ACO algorithm, SSA stores knowledge in construction graph and uses the solution component selection scheme of ACO algorithm to generate candidate solutions. Candidate list with bounded length is used to speed up SSA. The effect of knowledge-based sampling is verified on benchmark travelling salesman problems. Comparison studies show that SSA algorithm has promising performance in terms of convergence speed and solution accuracy.

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

[2]  Yiwen Zhong,et al.  Multi-Agent Simulated Annealing Algorithm Based on Particle Swarm Optimization Algorithm for Protein Structure Prediction , 2013 .

[3]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[4]  Hui Wang,et al.  An improved diversity-guided particle swarm optimisation for numerical optimisation , 2014, Int. J. Comput. Sci. Math..

[5]  Cheng-Fa Tsai,et al.  A new hybrid heuristic approach for solving large traveling salesman problem , 2004, Inf. Sci..

[6]  K. Manivannan,et al.  Computation of Capacity Benefit Margin using Differential Evolution , 2010, Int. J. Comput. Sci. Math..

[7]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

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

[9]  Craig A. Tovey,et al.  Simulated, simulated annealing , 1988 .

[10]  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).

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

[12]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[13]  Sheldon Howard Jacobson,et al.  The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.

[14]  Bing He,et al.  A novel two-stage hybrid swarm intelligence optimization algorithm and application , 2012, Soft Computing.

[15]  Shyi-Ming Chen,et al.  Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques , 2011, Expert Syst. Appl..

[16]  Hui Zhang,et al.  Multi-agent simulated annealing algorithm based on differential evolution algorithm , 2012, Int. J. Bio Inspired Comput..

[17]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[18]  ZhangHui,et al.  Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem , 2016 .

[19]  A. M. Ranjbar,et al.  A global Particle Swarm-Based-Simulated Annealing Optimization technique for under-voltage load shedding problem , 2009, Appl. Soft Comput..

[20]  Mauro Birattari,et al.  Model-Based Search for Combinatorial Optimization: A Critical Survey , 2004, Ann. Oper. Res..

[21]  Leandro Nunes de Castro,et al.  A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem , 2009, Inf. Sci..

[22]  Kai Zhao,et al.  Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search , 2011, Appl. Soft Comput..

[23]  Zhen Jin,et al.  An new self-organizing maps strategy for solving the traveling salesman problem , 2006 .

[24]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[25]  Wali Khan Mashwani.  Enhanced versions of differential evolution: state-of-the-art survey , 2014, Int. J. Comput. Sci. Math..

[26]  A. Abraham,et al.  Simplex Differential Evolution , 2009 .

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

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

[29]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[30]  Zehui Shao,et al.  An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman Problem , 2009 .

[31]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[32]  Chunguo Wu,et al.  Solving traveling salesman problems using generalized chromosome genetic algorithm , 2008 .

[33]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[34]  Zhi-Li Pei,et al.  An improved particle swarm optimisation for solving generalised travelling salesman problem , 2012, Int. J. Comput. Sci. Math..

[35]  Bo Wei,et al.  An improved PSO with detecting and local-learning strategy , 2014, Int. J. Comput. Sci. Math..

[36]  Changhe Li,et al.  Dynamic and random differential evolution solving constrained optimisation problems , 2014, Int. J. Comput. Sci. Math..

[37]  Sim Kim Lau,et al.  Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem , 2010, Eur. J. Oper. Res..

[38]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[39]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[40]  Hui Zhang,et al.  Multi-agent simulated annealing algorithm based on particle swarm optimisation algorithm , 2012, Int. J. Comput. Appl. Technol..

[41]  Zhiqiang Zhang,et al.  An improved elastic net method for traveling salesman problem , 2009, Neurocomputing.

[42]  Bennett L. Fox,et al.  Integrating and accelerating tabu search, simulated annealing, and genetic algorithms , 1993, Ann. Oper. Res..

[43]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[44]  Hui Zhang,et al.  Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling , 2015, Int. J. Comput. Sci. Math..