INTERNATIONAL RESEARCH JOURNAL OF SCIENCE ENGINEERING AND TECHNOLOGY

( Online- ISSN 2454 -3195 ) New DOI : 10.32804/RJSET

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 91    Submit Your Rating     Cite This   Download        Certificate

A REVIEW ON SOLVING TRAVELLING SALESMAN PROBLEM BY USING ANT COLONY OPTIMIZATION ALGORITHM

    2 Author(s):  PRIYANSHA MISHRA , SHRADDHA SRIVASTAVA

Vol -  5, Issue- 2 ,         Page(s) : 94 - 100  (2015 ) DOI : https://doi.org/10.32804/RJSET

Abstract

This paper reviews the various proposed research papers based on solving TSP problem through ACO algorithm. TSP is travelling salesman problem where the salesman starts from a single source and traverse all the cities exactly once and returns to the source. The objective of the Travelling Salesman is to cover the tour in minimum distance. This optimization problem can be solved by Ant Colony Optimization Algorithm (ACO) as the artificial agents(ants) cover the minimum path between the source(nest) to destination(food). The ACO algorithm is a heuristic approach combined with several other improved researches over the past years and this paper reviews those researches.

  1. A. Colorni, M. Dorigo, V. Maniezzo, "Distributed optimization by ant colonies”. Proceedings of European Conference on Artificial Life, Paris, France, pp. 134-142, 1991.
  2. Ramlakhan Singh Jadon, Unmukh Datta, Modified Ant Colony Algorithm with Uniform Mutation using Self Adaptive Approach for Travelling Salesman Problem,4th ICCCNT IEEE,2013
  3. Shigang Cui, Shaolang han, Ant Colony Algorithm and its application in solving Travelling Salesman Problem, Third International Conference on Instrumentation, Measurement , Computer, Communication and Control, 2013.
  4. Haibin Duan, Xiufen Yu, Hybrid Ant Colony Algorithm using Memetic Algorithm for Travelling Salesman Problem,IEEE,2007
  5. Gao Shang, Zhang Lei, Zhuang Fengting, Zhang Chunxian, 
  6. Solving Traveling Salesman Problem by Ant Colony Optimization Algorithm with Association Rule, ICNC, 2007
  7. Fanggeng Zhao, Jinyan Dong, Sujian Li and Jiangsheng Sun, An improved ant colony optimization algorithm with embedded genetic algorithm for the traveling salesman problem, Proceedings of the 7th World Congress on Intelligent Control and Automation,  2008
  8. Weimin Liu12, Sujian Li1, Fanggeng Zhao, Aiyun Zheng, An Ant Colony Optimization Algorithm for the Multiple Traveling Salesmen Problem,ICIEA,2009
  9. ZHU Ju-fang, LI Qing-, the Travelling Salesman Problem by the Program of Ant Colony Algorithm, IEEE, 2009

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details