CFP last date
20 May 2024
Reseach Article

Solution to Travelling Salesman Problem by Nature Inspired Algorithm

by Sarita Rai, Rajkumar Sharma
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 123 - Number 18
Year of Publication: 2015
Authors: Sarita Rai, Rajkumar Sharma
10.5120/ijca2015905818

Sarita Rai, Rajkumar Sharma . Solution to Travelling Salesman Problem by Nature Inspired Algorithm. International Journal of Computer Applications. 123, 18 ( August 2015), 52-54. DOI=10.5120/ijca2015905818

@article{ 10.5120/ijca2015905818,
author = { Sarita Rai, Rajkumar Sharma },
title = { Solution to Travelling Salesman Problem by Nature Inspired Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { August 2015 },
volume = { 123 },
number = { 18 },
month = { August },
year = { 2015 },
issn = { 0975-8887 },
pages = { 52-54 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume123/number18/22064-2015905818/ },
doi = { 10.5120/ijca2015905818 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:13:05.160610+05:30
%A Sarita Rai
%A Rajkumar Sharma
%T Solution to Travelling Salesman Problem by Nature Inspired Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 123
%N 18
%P 52-54
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Travelling salesman problem (TSP) finds applications in wide domains. It is a well known NP Hard problem. In this paper we have proposed nature inspired ant colony optimization on travelling salesman problem. A comparative analysis is done among the standard travelling salesman problem and proposed ant colony based approaches. All the implementations are compared in terms of communication overhead and execution time. It is found that multi colony based approach in which all colonies are independent is most efficient in terms of communication overhead and execution time.

References
  1. Gautam Garai, Shayantan Debbarman, Tamalika Biswas "An Efficient Ant Colony Optimization Algorithm for Function Optimization" in IEEE 2013.
  2. Tianjun Liao, Krzysztof Socha, Marco A. Montes de Oca, Thomas Stutzle "Ant Colony Optimization for Mixed-Variable Optimization Problems" in IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 18, NO. 4, AUGUST 2014.
  3. Ramlakhan Singh Jadon, Unmukh Datta "Modified Ant Colony Optimization Algorithm with Uniform Mutation using Self-Adaptive Approach for Travelling Salesman Problem" in IEEE 2013.
  4. Jerry Kponyo , Yujun Kuang , Enzhan Zhang "Dynamic Travel Path Optimization System Using Ant Colony Optimization" in IEEE 2014.
  5. Rafid Sagban, Ku Ruhana Ku Mahamud, Muhamad Shahbani Abu Bakar "Reactive Memory Model for Ant Colony Optimization and Its Application to TSP" in 2014 IEEE International Conference on Control System, Computing and Engineering, 28 - 30 November 2014, Penang, Malaysia.
  6. M. Veluscek, T. Kalganova, P. Broomhead "Improving Ant Colony Optimization Performance through Prediction of Best Termination Condition" in IEEE 2015.
  7. Zbigniew SWitnicki "Application of Ant Colony Optimization Algorithms for Transportation Problems Using the Example of the Travelling Salesman Problem" in 2015 4th IEEE International Conference on Advanced logistics and Transport (ICALT).
  8. Ms. K. Ilavarasi, Dr. K. Suresh Joseph "Variants of Travelling Salesman Problem: A Survey" in IEEE 2014.
  9. Morad BOUZIDI, Mohammed Essaid RIFF "Discrete Novel Hybrid Particle Swarm Optimization To Solve Travelling Salesman Problem" in IEEE 2014.
  10. Medhat A. Tawfeek, Ashraf El-Sisi, Arabi E. keshk, Fawzy A. Torkey "Cloud Task Scheduling Based on Ant Colony Optimization" in IEEE 2013.
Index Terms

Computer Science
Information Sciences

Keywords

Travelling salesman problem Ant colony optimization NP-Hard metaheuristic.