Manuscript Number : CSEIT1722335
Traveling Salesman Problem Using Genetic Algorithm: A Survey
Authors(3) :-Pooja Vaishnav, Dr. Naveen Choudhary, Kalpana Jain Traveling Salesman Problem is a well-known NP-Complete problem in computer science. It has many application areas in science and engineering. It is an optimization problem. TSP can be solved using heuristic techniques such as genetic algorithm. This paper gives a brief survey of various existing techniques for solving TSP using Genetic Algorithm. The paper compares the advantages and disadvantages of various algorithms for solving TSP using GA. The paper compares the performance of various algorithms to solve TSP and also suggest some fu-ture directions for research to motivate new researchers in this field.
Pooja Vaishnav Traveling Salesman Problem, Genetic Algorithm, Cross Over, Mutation Publication Details Published in : Volume 2 | Issue 3 | May-June 2017 Article Preview
Department of Computer Science and Engineering, College of Technology and Engineering, Udaipur, Rajasthan, India
Dr. Naveen Choudhary
Department of Computer Science and Engineering, College of Technology and Engineering, Udaipur, Rajasthan, India
Kalpana Jain
Department of Computer Science and Engineering, College of Technology and Engineering, Udaipur, Rajasthan, India
Date of Publication : 2017-06-30
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 105-108
Manuscript Number : CSEIT1722335
Publisher : Technoscience Academy
Journal URL : http://ijsrcseit.com/CSEIT1722335