Some Applications of the Generalized Travelling Salesman Problem
Academic Article
-
- Overview
-
- Identity
-
- Additional Document Info
-
- View All
-
Overview
abstract
-
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. © 1996, Operational Research Society Ltd. All rights reserved.
altmetric score
author list (cited authors)
-
Laporte, G., Asef-Vaziri, A., & Sriskandarajah, C.
citation count
complete list of authors
-
Laporte, Gilbert||Asef-Vaziri, Ardavan||Sriskandarajah, Chelliah
publication date
publisher
published in
Identity
Digital Object Identifier (DOI)
Additional Document Info
start page
end page
volume
issue