An efficient genetic algorithm for solving the generalized traveling salesman problem


The generalized traveling salesman problem (GTSP) is a generalization of the classical traveling salesman problem. The GTSP is known to be an NP-hard problem and has many interesting applications. In this paper we present a local-global approach for the generalized traveling salesman problem and as well an efficient algorithm for solving the problem based on genetic algorithms. Computational results are reported for Euclidean TSPlib instances and compared with the existing ones. The obtained results point out that our GA is an appropriate method to explore the search space of this complex problem and leads to good solutions in a short amount of time.

3 Figures and Tables

Showing 1-10 of 22 references

Evolutionary Computation: Principles and Practices

  • O Matei
  • 2008
1 Excerpt

Reinforcing Ant Colony System for the Generalized Traveling Salesman Problem

  • C Pintea, P C Pop, C Chira
  • 2006
1 Excerpt
Showing 1-2 of 2 extracted citations