Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

The generalized traveling salesman problem (GTSP) is a well-known combinatorial optimization problem with a host of applications. It is an extension of the Traveling Salesman Problem (TSP) where the set of cities is partitioned into so-called clusters, and the salesman has to visit every cluster exactly once.

MoreLess

Year of publication:	2012
Authors:	Karapetyan, D. ; Gutin, G.
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 219.2012, 2, p. 234-251
Publisher:	Elsevier
Subject:	Heuristics \| Local search \| Neighborhood \| Generalized traveling salesman problem \| Combinatorial optimization

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010574163