Authors
Gilbert Laporte, Ardavan Asef-Vaziri, Chelliah Sriskandarajah
Publication date
1996/12/1
Journal
Journal of the Operational Research Society
Volume
47
Issue
12
Pages
1461-1467
Publisher
Palgrave Macmillan UK
Description
In the Generalized Travelling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertices. It is shown that a wide variety of combinatorial optimization problems can be modelled as GTSPs. These problems include location-routeing problems, material flow system design, post-box collection, stochastic vehicle routeing and arc routeing.
Total citations
Scholar articles
G Laporte, A Asef-Vaziri, C Sriskandarajah - Journal of the Operational Research Society, 1996