COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS
- 12 December 2008
- journal article
- research article
- Published by Taylor & Francis in Cybernetics and Systems
- Vol. 40 (1) , 1-24
Abstract
Despite the existence of a number of variations of genetic algorithms for the traveling salesman problem in literature, no efforts have been made to the best of our knowledge to characterize their performance. This paper presents a detailed comparative study on some of the solution methods for the traveling salesman problem using genetic algorithms. All the operators of genetic algorithms have been given equal emphasis in the analysis. The complete simulation has been done using a number of C programs written by us for this purpose. A permanent network has been particularly considered for this task. The results shed insight on the best solution method for the problem. However, we cannot conclude how the behavior of those algorithms depends on network topology.Keywords
This publication has 5 references indexed in Scilit:
- Approximation schemes for NP-hard geometric optimization problems: a surveyMathematical Programming, 2003
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960