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...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Intelligent Computer Communication and Processing pp. 87 - 92
Main Authors Matei, Oliviu, Pop, Petrică
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2010
Subjects
Clustering algorithms
Gallium
generalized traveling salesman problem
Genetic algorithms
Genetics
Heuristic algorithms
Memetics
Traveling salesman problems
Online AccessGet full text
ISBN9781424482283
1424482283
DOI10.1109/ICCP.2010.5606458

Cover

More Information
Summary: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.
ISBN:9781424482283
1424482283
DOI:10.1109/ICCP.2010.5606458