A Comparative Study Of ACO and GA For Solving Travelling Salesman Problem |
Author(s): |
| Sheetal Dewangan , Ccet bhilai; Pardeep Vaisnav, G d rungta; Morrish Kumar |
Keywords: |
| Random Travelling salesman Problem (RTSP), Ant Colony Optimization (ACO), Genertic Algorithm (GA) |
Abstract |
|
This study discusses the travelling salesman problem and by presenting the history of the methods used in solving the travelling salesman problem intends to solve the problem by Meta-Heuristic Algorithms such as Ant Colony Optimization and Genetic Algorithm. In this paper, Ant Colony Optimization and Genetic Algorithm are presented for Random Travelling Salesman Problem (RTSP). Random Travelling Salesman Problem is a variant of TSP. All TSP dataset used here are constructed randomly and then ACO and GA model are applied on those data sets. Ant Colony Optimization has higher efficiency in solving Traveling Salesman Problem than Genetic Algorithm. Experimental results are discussed based on several criteria like time, quality and accuracy. |
Other Details |
|
Paper ID: IJSRDV4I40593 Published in: Volume : 4, Issue : 4 Publication Date: 01/07/2016 Page(s): 574-576 |
Article Preview |
|
|
|
|
