DOIONLINE 
DOIONLINE Publish In |
International Journal of Mechanical and Production Engineering (IJMPE)-IJMPE |
 Journal Home Volume Issue |
||||||||
Issue |
Volume-5,Issue-11 ( Nov, 2017 ) | |||||||||
Paper Title |
A Comparative Study of GA and ACO for Solving Travelling Salesman Problem | |||||||||
Author Name |
Nitin Chandekar, M. Jayachandran Pillai | |||||||||
Affilition |
Mechanical Engineering RSR RCET, Bhilai, C.G. M.E. Industrial Engineering Guindy, Anna University Chennai, Tamil Nadu | |||||||||
Pages |
34-37 | |||||||||
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 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. Keywords - Random Travelling salesman Problem(RTSP), Ant Colony Optimization (ACO),Genertic Algorithm(GA) | |||||||||
| View Paper | ||||||||||
