Some Applications of the Generalized Travelling Salesman Problem Academic Article uri icon

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

  • 0.5

author list (cited authors)

  • Laporte, G., Asef-Vaziri, A., & Sriskandarajah, C.

citation count

  • 115

complete list of authors

  • Laporte, Gilbert||Asef-Vaziri, Ardavan||Sriskandarajah, Chelliah

publication date

  • December 1996