Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem

List-based simulated annealing (LBSA) algorithm is a novel simulated annealing algorithm where list-based cooling scheme is used to control the change of parameter temperature. Aiming to improve the efficiency of the LBSA algorithm for large-scale optimization problems, this paper proposes an enhanced LBSA (ELBSA) algorithm for solving large-scale traveling salesman problem (TSP). The ELBSA algorithm can drive more sampling at more suitable temperatures and from more promising neighborhoods. Specifically, heuristic augmented sampling strategy is used to ensure that more neighbors are from promising neighborhoods, systematic selection strategy is proposed to guarantee that each component of the current solution has a chance to be improved, and variable Markov chain length (VMCL), based on arithmetic sequence, is used to sample more neighbors at more suitable temperatures. Extensive experiments were performed to show the contribution of the heuristic augmented sampling strategy, and to verify the advantage of using systematic selection and VMCL. Comparative experiments, which were conducted on a wide range of large-scale TSP instances, show that the ELBSA algorithm is better than or competitive with most other state-of-the-art metaheuristics.

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

[2]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[3]  Juan Lin,et al.  Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem , 2018, Swarm Evol. Comput..

[4]  Zuren Feng,et al.  Two-stage updating pheromone for invariant ant colony optimization algorithm , 2012, Expert Syst. Appl..

[5]  Chang-Sung Jeong,et al.  Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections , 1991, Parallel Comput..

[6]  Ulrich W. Thonemann,et al.  Optimizing simulated annealing schedules with genetic programming , 1996 .

[7]  Qin Zhang,et al.  A best-path-updating information-guided ant colony optimization algorithm , 2018, Inf. Sci..

[8]  Okan K. Ersoy,et al.  Multi-offspring genetic algorithm and its application to the traveling salesman problem , 2016, Appl. Soft Comput..

[9]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[10]  Georgios Dounias,et al.  Honey bees mating optimization algorithm for the Euclidean traveling salesman problem , 2011, Inf. Sci..

[11]  Xin-She Yang,et al.  An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems , 2016, Eng. Appl. Artif. Intell..

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

[13]  Hassan Ismkhan.  Effective heuristics for ant colony optimization to handle large-scale problems , 2017, Swarm Evol. Comput..

[14]  M Hasegawa,et al.  Verification and rectification of the physical analogy of simulated annealing for the solution of the traveling salesman problem. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Juan Lin,et al.  Evolutionary harmony search algorithm with Metropolis acceptance criterion for travelling salesman problem , 2016, Int. J. Wirel. Mob. Comput..

[16]  Li-Pei Wong,et al.  Bee Colony Optimization with local search for traveling salesman problem , 2008, INDIN 2008.

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

[18]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

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

[20]  Salim Haddadi,et al.  Simulated annealing for the uncapacitated exam scheduling problem , 2016, Int. J. Metaheuristics.

[21]  Alfonsas Misevicius,et al.  A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem , 2003, Informatica.

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

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

[24]  Julius Beneoluchi Odili,et al.  Solving the Traveling Salesman's Problem Using the African Buffalo Optimization , 2016, Comput. Intell. Neurosci..

[25]  Aderemi Oluyinka Adewumi,et al.  Discrete symbiotic organisms search algorithm for travelling salesman problem , 2017, Expert Syst. Appl..

[26]  Xin-She Yang,et al.  Discrete cuckoo search algorithm for the travelling salesman problem , 2014, Neural Computing and Applications.

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

[28]  P. V. Laarhoven,et al.  A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem , 1988 .

[29]  Hui Zhang,et al.  Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem , 2016, Int. J. Intell. Syst. Technol. Appl..

[30]  Min Lin,et al.  Discrete pigeon-inspired optimization algorithm with Metropolis acceptance criterion for large-scale traveling salesman problem , 2019, Swarm Evol. Comput..

[31]  Juan Lin,et al.  List-Based Simulated Annealing Algorithm for Traveling Salesman Problem , 2016, Comput. Intell. Neurosci..

[32]  Wang Yong,et al.  Hybrid Max–Min ant system with four vertices and three lines inequality for traveling salesman problem , 2015, Soft Comput..

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

[34]  Jean-Charles Créput,et al.  A massively parallel neural network approach to large-scale Euclidean traveling salesman problems , 2017, Neurocomputing.

[35]  Aderemi Oluyinka Adewumi,et al.  Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem , 2017, Expert Syst. Appl..

[36]  Jinzhao Wu,et al.  A discrete invasive weed optimization algorithm for solving traveling salesman problem , 2015, Neurocomputing.

[37]  László T. Kóczy,et al.  Enhanced discrete bacterial memetic evolutionary algorithm - An efficacious metaheuristic for the traveling salesman optimization , 2017, Inf. Sci..

[38]  Zhe Xu Non-member,et al.  Immune algorithm combined with estimation of distribution for traveling salesman problem , 2016 .

[39]  Yu Lin,et al.  Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing - tabu search algorithm to solve the symmetrical traveling salesman problem , 2016, Appl. Soft Comput..

[40]  Hansuk Sohn,et al.  A modified ant system to achieve better balance between intensification and diversification for the traveling salesman problem , 2017, Appl. Soft Comput..

[41]  James R. A. Allwright,et al.  A distributed implementation of simulated annealing for the travelling salesman problem , 1989, Parallel Comput..

[42]  Abdulqader M. Mohsen,et al.  Annealing Ant Colony Optimization with Mutation Operator for Solving TSP , 2016, Comput. Intell. Neurosci..

[43]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[44]  Juan F. Jiménez,et al.  Ant Colony Extended: Experiments on the Travelling Salesman Problem , 2015, Expert Syst. Appl..

[45]  P. Victer Paul,et al.  Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: An empirical study based on traveling salesman problems , 2015, Appl. Soft Comput..

[46]  Jie Zhou,et al.  Dynamic multiscale region search algorithm using vitality selection for traveling salesman problem , 2016, Expert Syst. Appl..

[47]  Peng Tian,et al.  An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem , 1993 .

[48]  Mohammed Essaid Riffi,et al.  A novel discrete bat algorithm for solving the travelling salesman problem , 2015, Neural Computing and Applications.

[49]  Juan Lin,et al.  Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem , 2017, Inf. Sci..