A Survey on Ant Colony Optimization Algorithm for Travelling Salesman Problem

Authors

  • Ranjeet Savita VITM, Gwalior
  • Pankaj Sharma
  • Manish Gupta

DOI:

https://doi.org/10.37591/joipprp.v5i1.1439

Abstract

The ant colony optimization algorithm, abbreviated as ACO, is a meta-heuristic optimization algorithm which is based on the probability for solving different computational problems such as travelling salesman problem (TSP), job scheduling problem, vehicle routing problem etc. This algorithm is a member of ant colony algorithms family in swarm intelligence methods, which is based on the foraging behaviour of real ants. This paper presents a review on a variety of modified versions of ant colony optimization algorithms for solving travelling salesman problem. This work is helpful for a variety of researchers to solve TSP problem using a variety of modified versions of ACO algorithms.

 

References

Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies, Proceedings of European Conference on Artificial Life, Paris, France, 134–142p, 1991.

Jakob V, Ren T. A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. Proceedings of Congress on Evolutionary Computation, Poland, 2004; 2: 1980–1987p.

X-song, LI B, YANG H. Improved Ant Colony Algorithm and Its Applications in TSP, Proceedings of Sixth International Conference on Intelligent Systems Design and Applications (ISDA’06), IEEE, 2006.

Stutzle T. Algorithm for, H.H. Hoos, MAX-MIN ant system and local search for the traveling salesman problem, IEEE Int’l Conf. on Evolutionary Computation. Indianapolis: IEEE Press, 1997. 309~314.

Jadon RLS, Datta U. Modified ant colony optimization algorithm with uniform mutation using self-adaptive approach for travelling salesman problem, ICCCNT-2013, IEEE, Tiruchengode, India.

Zhang Y, Pei Z-l, Yang J-h, et al. An Improved Ant Colony Optimization Algorithm Based on Route Optimization and Its Applications in Traveling Salesman Problem, IEEE International Conference on Bioinformatics and Bioengineering, 2007. 1-4244-1509-8.

Zhao F, Dong J, Li S, et al. An improved ant colony optimization algorithm with embedded genetic algorithm for the travelling salesman problem, Proceedings of the 7th World Congress on Intelligent Control and Automation, Chongqing, China, June 25-27, 2008.

Gan R, Guo Q, Chang H, et al. Improved ant colony optimization algorithm for the travelling salesman problems, J Syst Eng Electron. April 2010; 21(2): 329–333p.

Abd Aziz Z. Ant Colony Hyper-heuristics for Travelling Salesman Problem, IEEE International Symposium on Robotics and Intelligent Sensors (IRIS 2015), Procedia Computer Science. 2015; 76: 534–538p.

Shufen L, Huang L, Lu H. Pheromone Model Selection in Ant Colony Optimization for the Travelling Salesman Problem, Chinese J Electr. 26(2): Mar. 2017.

Downloads

Published

2018-04-26

Issue

Vol. 5 No. 1 (2018)

Section

Review Articles

License

Declaration and Copyright Transfer Form

(to be completed by authors)

I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.

  • I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
  • I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
  • I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
  •  I/We also agree to the authorship of the article in the following order:

Author’s name                                    

 

1. ________________

2. ________________

3. ________________

4. ________________

 

We  Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal.