Downloads: 104 | Views: 124
Research Paper | Computer Science & Engineering | India | Volume 4 Issue 5, May 2015
A Novel Method to Solve Travelling Salesman Problem Using Sequential Constructive Crossover Using Map/Reduce Framework
Anitha Rao | Sandeep Kumar Hegde
Abstract: The Travelling Salesman Problem (TSP) is well known in the field of combinatorial optimization. Since it is an NP-complete problem, there is no efficient method to solve this problem and give the best result. Many algorithms are used to solve travelling salesman problem. Some algorithms give optimal solution, but some other algorithms give the nearest optimal solution. The genetic algorithm is a heuristic method which is used to improve the solution space for the Travelling Salesman Problem. The genetic algorithm results in nearest optimal solution within a reasonable time. This paper mainly focuses on the various stages of genetic algorithm and comparative study of various methods used in the genetic algorithm. The paper also proposes a method to solve the travelling salesman problem using Sequential Constructive Crossover operator and hence improve the quality of solution space.
Keywords: Travelling Salesman Problem, Genetic Algorithm, Selection, Sequential Constructive Crossover, Mutation
Edition: Volume 4 Issue 5, May 2015,
Pages: 1362 - 1367
Similar Articles with Keyword 'Travelling Salesman Problem'
Experimental Result Paper, Computer Science & Engineering, India, Volume 11 Issue 11, November 2022Pages: 667 - 674
Exploring a Minimum Cost Solution for Traveling Salesman Problem using Parallel Simulated Annealing
Geerisha Jain | Dr. Anto S | Dewang Mehta
Review Papers, Computer Science & Engineering, India, Volume 3 Issue 12, December 2014Pages: 1824 - 1829
Review Paper on: Image Processing Using Smooth Ordering of its Patches
Chavan Suvarna S. | Chaudhari B.P.