Some Applications of the Generalized Travelling Salesman Problem Academic Article

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.

authors

• Sriskandarajah, Chelliah

published proceedings

• Journal of the Operational Research Society

altmetric score

• 0.5

author list (cited authors)

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

citation count

• 133

complete list of authors

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

publication date

• December 1996

publisher

• Taylor & Francis  Publisher

published in

• JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY  Journal

Digital Object Identifier (DOI)

• 10.1057/jors.1996.190

start page

• 1461

end page

• 1467

volume

• 47

issue

• 12

URL

• http://dx.doi.org/10.1057/jors.1996.190