Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques

In this paper, we present a new method, called the genetic simulated annealing ant colony system with particle swarm optimization techniques, for solving the traveling salesman problem. We also make experiments using the 25 data sets obtained from the TSPLIB (http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/) and compare the experimental results of the proposed method with the methods of Angeniol, Vaubois, and Texier (1988), Somhom, Modares, and Enkawa (1997), Masutti and Castro (2009) and Pasti and Castro (2006). The experimental results show that both the average solution and the percentage deviation of the average solution to the best known solution of the proposed method are better than the methods of Angeniol et al. (1988), Somhom et al. (1997), Masutti and Castro (2009) and Pasti and Castro (2006).

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

[2]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[3]  Holger H. Hoos,et al.  Improving the Ant System: A Detailed Report on the MAX-MIN Ant System , 1996 .

[4]  Tomasz Dominik Gwiazda.  Mutation operator for numerical optimization problems , 2007 .

[5]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[6]  Moritoshi Yasunaga,et al.  Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[7]  Shyi-Ming Chen,et al.  A new method for solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques , 2010, 2010 International Conference on Machine Learning and Cybernetics.

[8]  B. John Oommen,et al.  The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem , 1999, Neural Networks.

[9]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[10]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

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

[12]  Tomasz Dominik Gwiazda,et al.  Crossover for single-objective numerical optimization problems , 2006 .

[13]  Yanchun Liang,et al.  An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows , 2008, 2008 Fourth International Conference on Natural Computation.

[14]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[15]  T.O. Ting,et al.  A novel approach for unit commitment problem via an effective hybrid particle swarm optimization , 2006, IEEE Transactions on Power Systems.

[16]  Magdalene Marinaki,et al.  A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..

[17]  Olivier C. Martin,et al.  Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..

[18]  D. Kaur,et al.  Performance enhancement in solving Traveling Salesman Problem using hybrid genetic algorithm , 2008, NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society.

[19]  Takao Enkawa,et al.  A self-organising model for the travelling salesman problem , 1997 .

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

[21]  Lijie Li,et al.  Improved Ant Colony Optimization for the Traveling Salesman Problem , 2008, 2008 International Conference on Intelligent Computation Technology and Automation (ICICTA).

[22]  Mehmet Fatih Tasgetiren,et al.  A genetic algorithm for the generalized traveling salesman problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

[23]  Pei-Chann Chang,et al.  Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems , 2010, Expert Syst. Appl..

[24]  Jiming Liu,et al.  Multiagent Optimization System for Solving the Traveling Salesman Problem (TSP) , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[25]  Guangzhou Zeng,et al.  Study of genetic algorithm with reinforcement learning to solve the TSP , 2009, Expert Syst. Appl..

[26]  Chi-Bin Cheng,et al.  Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm , 2009, Expert Syst. Appl..

[27]  Leandro dos Santos Coelho,et al.  Coevolutionary Particle Swarm Optimization Using Gaussian Distribution for Solving Constrained Optimization Problems , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[28]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[29]  Paul H. Calamai,et al.  Exchange strategies for multiple Ant Colony System , 2007, Inf. Sci..

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

[31]  Hossein Miar Naimi,et al.  New robust and efficient ant colony algorithms: Using new interpretation of local updating process , 2009, Expert Syst. Appl..

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

[33]  E. M. Cochrane,et al.  The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem , 2003, Neural Networks.

[34]  Zheng Tang,et al.  A Fast Elastic Net Method for Traveling Salesman Problem , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

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

[36]  Leandro Nunes de Castro,et al.  A Neuro-Immune Network for Solving the Traveling Salesman Problem , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.

[37]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[38]  Chin-Teng Lin,et al.  A Hybrid of Cooperative Particle Swarm Optimization and Cultural Algorithm for Neural Fuzzy Networks and Its Prediction Applications , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[39]  L. Coelho,et al.  Discrete Differential Evolution with local search to solve the Traveling Salesman Problem: Fundamentals and case studies , 2008, 2008 7th IEEE International Conference on Cybernetic Intelligent Systems.

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

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

[42]  Gang Zhao,et al.  A Genetic Algorithm Balancing Exploration and Exploitation for the Travelling Salesman Problem , 2008, 2008 Fourth International Conference on Natural Computation.

[43]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

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

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

[46]  Shyi-Ming Chen,et al.  A new method for handling the traveling salesman problem based on parallelized genetic ant colony systems , 2009, 2009 International Conference on Machine Learning and Cybernetics.