A Modified Ant Colony Algorithm for Traveling Salesman Problem

Ant colony algorithms such as Ant Colony Optimization (ACO) have been effectively applied to solve the Traveling Salesman problem (TSP). However, traditional ACO algorithm has some issues such as long iterative length and prone to local convergence. To this end, we propose we embed ACO into Cultural Algorithm (CA) framework by leveraging the dual inheritance mechanism. Best solutions are evolved in both population space and belief space, and the communication between them is achieved by accept and influence operations. Besides, we employ multiple population spaces for parallel execution. Experiments show that the performance of our proposed algorithm is greatly improved.

[1]  Elias Kyriakides,et al.  Hybrid Ant Colony-Genetic Algorithm (GAAPI) for Global Continuous Optimization , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[3]  Walter J. Gutjahr,et al.  A Converging ACO Algorithm for Stochastic Combinatorial Optimization , 2003, SAGA.

[4]  Krzysztof Socha,et al.  Ant Colony Optimization and Swarm Intelligence , 2004, Lecture Notes in Computer Science.

[5]  Peng Zhang,et al.  An Adaptive Heterogeneous Multiple Ant Colonies Algorithm , 2010, J. Intell. Syst..

[6]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

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

[8]  R. Reynolds.  AN INTRODUCTION TO CULTURAL ALGORITHMS , 2008 .

[9]  Xingyu Wang,et al.  Cultured Differential Particle Swarm Optimization for Numerical Optimization Problems , 2007, Third International Conference on Natural Computation (ICNC 2007).

[10]  Jianpei Zhang,et al.  Research on cultural algorithm for solving routing problem of mobile agent , 2008 .

[11]  Guoliang Xing,et al.  Rendezvous design algorithms for wireless sensor networks with a mobile base station , 2008, MobiHoc '08.

[12]  W. Gutjahr.  A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC , 2003, Probability in the Engineering and Informational Sciences.

[13]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[14]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[15]  Walter J. Gutjahr,et al.  A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..

[16]  Yuvraj Gajpal,et al.  Multi-ant colony system (MACS) for a vehicle routing problem with backhauls , 2009, Eur. J. Oper. Res..

[17]  Milan Tuba,et al.  Improved ACO Algorithm with Pheromone Correction Strategy for the Traveling Salesman Problem , 2013, Int. J. Comput. Commun. Control.

[18]  Liu Enhai,et al.  Improved culture ant colony optimization method for solving TSP problem , 2010 .

[19]  Liu Sheng,et al.  A Cultural Ant Colony System for Solving TSP Problem , 2009 .

[20]  Yuvraj Gajpal,et al.  An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup , 2009, Comput. Oper. Res..

[21]  Keivan Ghoseiri,et al.  An ant colony optimization algorithm for the bi-objective shortest path problem , 2010, Appl. Soft Comput..

[22]  Robert G. Reynolds,et al.  CAEP: An Evolution-Based Tool for Real-Valued Function Optimization Using Cultural Algorithms , 1998, Int. J. Artif. Intell. Tools.

[23]  张军,et al.  Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems , 2008 .

[24]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[25]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

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

[27]  Yuren Zhou,et al.  Runtime Analysis of an Ant Colony Optimization Algorithm for TSP Instances , 2009, IEEE Transactions on Evolutionary Computation.

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

[29]  Ioan Dzitac,et al.  Synthetic Genes for Artificial Ants. Diversity in Ant Colony Optimization Algorithms , 2010, Int. J. Comput. Commun. Control.

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