A Solution of Genetic Algorithm for solving Traveling Salesman Problem |
Author(s): |
| Sonam khattar , Galaxy Global Imperial Technical Campus, Dinarpur, Ambala; Puneet Gosawmi, Galaxy Global Group of Institutions,Dinarpur,Ambala |
Keywords: |
| TSP, Genetic Algorithm(GA), Selection, Mutation, Crossover. |
Abstract |
|
Genetic Algorithm is used to solve an optimization problems and Travelling Salesman Problem (TSP) is an optimization problem. TSP is an NP hard problem in combinational optimization important in operations research and theoretical computer science. The amount of computational time to solve this problem grows exponentially as the number of cities. These problems demand innovative solutions if they are to be solved within a reasonable amount of time. This paper explores the solution of Travelling Salesman Problem using genetic algorithms. The aim of this paper is to review how genetic algorithm applied to these problem and find an efficient solution. |
Other Details |
|
Paper ID: IJSRDV2I4123 Published in: Volume : 2, Issue : 4 Publication Date: 01/07/2014 Page(s): 341-343 |
Article Preview |
|
|
|
|
