Ant Colony Optimization (ACO) For The Traveling Salesman Problem (TSP) Using Partitioning

An ant colony optimization is a technique which was introduced in 1990’s and which can be applied to a variety of discrete (combinatorial) optimization problem and to continuous optimization. The ACO algorithm is simulated with the foraging behavior of the real ants to find the incremental solution constructions and to realize a pheromone laying-and-following mechanism. This pheromone is the indirect communication among the ants. In this paper we introduces the partitioning technique based on the divide and conquer strategy for the traveling salesman problem (which is one of the most important combinatorial problem) in which the original problem is partitioned into the group of sub problems. And then we apply the ant colony algorithm using candidate list strategy for each smaller sub problems. After that by applying the local optimization and combining the sub problems to find the good solution for the original problem by improving the exploration efficiency of the ants. At the end of this paper we have also be presented the comparison of result with the normal ant colony system for finding the optimal solution to the traveling salesman problem.

[1]  Ju-Jang Lee,et al.  Global path planning using improved ant colony optimization algorithm through bilateral cooperative exploration , 2011, 5th IEEE International Conference on Digital Ecosystems and Technologies (IEEE DEST 2011).

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

[3]  K. Sheibani.  The fuzzy greedy search in combinatorial optimization with specific reference to the travelling salesman problem , 2010, 2010 IEEE International Conference on Industrial Engineering and Engineering Management.

[4]  Jun Zhang,et al.  SamACO: Variable Sampling Ant Colony Optimization Algorithm for Continuous Optimization , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[5]  Mary E. Kurz.  Heuristics for the Traveling Salesman Problem , 2011 .

[6]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[7]  Mohamed A. El-Sharkawi,et al.  Modern heuristic optimization techniques :: theory and applications to power systems , 2008 .

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

[9]  Yulan Hu,et al.  Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm , 2007, Third International Conference on Natural Computation (ICNC 2007).

[10]  Shukai Cai,et al.  A Brief Review of Ant Algorithms , 2009, 2009 First International Conference on Information Science and Engineering.

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

[12]  R. S. Jadon,et al.  Modified ant colony optimization algorithm with uniform mutation using self-adaptive approach for travelling salesman problem , 2013 .

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

[14]  Costin Badica,et al.  Effectiveness of solving traveling salesman problem using Ant Colony Optimization on distributed multi-agent middleware , 2010, Proceedings of the International Multiconference on Computer Science and Information Technology.

[15]  Z.A. Othman,et al.  Reducing iteration using candidate list , 2008, 2008 International Symposium on Information Technology.

[16]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[17]  R. Matthews,et al.  Ants. , 1898, Science.

[18]  R. S. Jadon,et al.  Modified ant colony optimization algorithm with uniform mutation using self-adaptive approach for travelling salesman problem , 2013, 2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT).

[19]  Christian Steczkó Nilsson,et al.  Heuristics for the Traveling Salesman Problem , 2003 .