A genetic algorithm for the generalized traveling salesman problem

Author

Tasgetiren, M. Fatih ; Suganthan, P.N. ; Pan, Quan-ke ; Liang, Yun-Chia

Author_Institution

Dept. of Oper. Manage. & Bus. Stat., Muscat

fYear

2007

fDate

25-28 Sept. 2007

Firstpage

2382

Lastpage

2389

Abstract

In a traveling salesman problem, if the set of nodes is divided into clusters so that a single node from each cluster can be visited, then the problem is known as the generalized traveling salesman problem where the objective is to find a tour with minimum cost passing through only a single node from each cluster. In this paper, a genetic algorithm is presented to solve the problem on a set of benchmark instances. The genetic algorithm is hybridized with an iterated local search to further improve the solution quality. Some speed-up methods are presented to accelerate the greedy node insertions. The genetic algorithm is tested on a set of benchmark instances with symmetric distances ranging from 51 to 442 nodes from the literature. Computational results show that the proposed genetic algorithm is the best performing algorithm so far in the literature in terms of solution quality.

Keywords

genetic algorithms; iterative methods; search problems; travelling salesman problems; generalized traveling salesman problem; genetic algorithm; greedy node insertions; iterated local search; Evolutionary computation; Genetic algorithms; Traveling salesman problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Conference_Location

Singapore

Print_ISBN

978-1-4244-1339-3

Electronic_ISBN

978-1-4244-1340-9

Type

conf

DOI

10.1109/CEC.2007.4424769

Filename

4424769