Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Integer Programming Formulation of Traveling Salesman Problems
Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Genetic Algorithms for the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Computational Intelligence: Principles, Techniques and Applications
Computational Intelligence: Principles, Techniques and Applications
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Crossroads
Solving the traveling salesman problem using cooperative genetic ant systems
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
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.