Performance Analysis of Genetic Algorithm, Particle Swarm Optimization and Ant Colony Optimization for Solving the Travelling Salesman Problem
Valarmathi B1, Santhi K2, Ravi Chandrika3, Peeyush Goel4, Bhagyashree Bagwe5
1Valarmathi B, Associate Professor, Department of Software Engineering, Vellore Institute of Technology, Vellore (Tamil Nadu), India.
2Santhi K, Associate Professor, Department of Analytics, School of Computer Science and Engineering, Vellore Institute of Technology, Vellore (Tamil Nadu), India.
3Ravi Chandrika, B.Tech Student, Department of Information Technology, Vellore Institute of Technology, Vellore (Tamil Nadu), India.
4Peeyush Goel, B.Tech Student, Department of Information Technology, Vellore Institute of Technology, Vellore (Tamil Nadu), India.
5Bhagyashree Bagwe, B.Tech Student, Department of Information Technology, Vellore Institute of Technology, Vellore (Tamil Nadu), India.
Manuscript received on 02 July 2019 | Revised Manuscript received on 12 August 2019 | Manuscript Published on 27 August 2019 | PP: 91-95 | Volume-8 Issue-2S4 July 2019 | Retrieval Number: B10160782S419/2019©BEIESP | DOI: 10.35940/ijrte.B1016.0782S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The Travelling salesman problem also popularly known as the TSP, which is the most classical combinatorial optimization problem. It is the most diligently read and an NP hard problem in the field of optimization. When the less number of cities is present, TSP is solved very easily but as the number of cities increases it gets more and more harder to figure out. This is due to a large amount of computation time is required. So in order to solve such large sized problems which contain millions of cities to traverse, various soft computing techniques can be used. In this paper, we discuss the use of different soft computing techniques like Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and etc. to solve TSP.
Keywords: Ant Colony Optimization, Genetic Algorithm, Particle Swarm Optimization, Soft Computing, Travelling Salesman Problem.
Scope of the Article: Algorithm Engineering