Solving Travelling Salesmen Problem using Ant Colony Optimization Algorithm

  • B. V. Raghavendra Assistant Professor, JSS Academy of Technical Education, Bangalore, India
Keywords: Ant Colony Optimization, Travelling Salesman Problems.

Abstract

Ant Colony Optimization is a new meta-heuristic technique used for solving different combinatorial optimization problems. ACO is based on the behaviors of ant colony and this method has strong robustness as well as good distributed calculative mechanism. ACO has very good search capability for optimization problems. Travelling salesman problem is one of the most famous combinatorial optimization problems. In this paper we applied the ant colony optimization technique for symmetric travelling salesperson problem. Analysis are shown that the ant select the rich pheromone distribution edge for finding out the best path.

Downloads

Download data is not yet available.

References

C. M. Dorigo, V. Maniezzo, and A. Colorni, “The ant system: Optimization by a colony of cooperating agents,” IEEE Transactions on System, Man, and Cybernetics, Part B, vol.26, pp. 29-41, 1996.

C.Blum, “Ant Colony Optimization: Introduction and recent trends,” Science Direct, Physics of Life Reviews 2(2005)353-373.

Zar Chi Su Su Hlaing and May Aye Khine, Member, IACSIT, Solving Traveling Salesman Problem by Using Improved Ant Colony Optimization Algorithm, International Journal of Information and Education Technology, Vol. 1, No. 5, December 2011, pp404-409.

Utkarsh Jaiswal, Shweta Aggarwal, Ant Colony Optimization, International Journal of Scientific & Engineering Research Volume 2, Issue 7, July-2011, pp 1-7.

Krishna H. Hingrajiya, Ravindra Kumar Gupta, Gajendra Singh Chandel, An Ant Colony Optimization Algorithm for Solving Travelling Salesman Problem, International Journal of Scientific and Research Publications, Volume 2, Issue 8, August 2012, pp 1-6,

M. Dorigo, L M Gambardella Ant colonies for the traveling salesman problem. Bio Systems, 1997.

M. Dorigo, L M Gambardella Ant Colony system; A cooperative learning approach to the Travelling salesman problem. IEEE Transactions on Evolutionary Computation, Vol.1, No.1, 1997

Marco Dorigo and Thomas Stutzle, Ant Colony Optimization, MIT Press, 2004.

Singiresu S. Rao, Engineering Optimization, Theory and Practice, Fourth Edition, John Wiley & Sons, Inc.

Published
2015-03-30
How to Cite
Raghavendra, B. V. (2015). Solving Travelling Salesmen Problem using Ant Colony Optimization Algorithm. Journal of Information Sciences and Computing Technologies, 3(1), 170-179. Retrieved from https://scitecresearch.com/journals/index.php/jisct/article/view/88
Issue
Vol 3 No 1: JISCT
Section
Articles

Copyright (c) 2015 Journal of Information Sciences and Computing Technologies

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

TRANSFER OF COPYRIGHT

JISCT is pleased to undertake the publication of your contribution to Journal of Information Sciences and Computing Technologies

The copyright to this article is transferred to JISCT(including without limitation, the right to publish the work in whole or in part in any and all forms of media, now or hereafter known) effective if and when the article is accepted for publication thus granting JISCT all rights for the work so that both parties may be protected from the consequences of unauthorized use.