G. Laporte et al., SOME APPLICATIONS OF THE GENERALIZED TRAVELING SALESMAN PROBLEM, The Journal of the Operational Research Society, 47(12), 1996, pp. 1461-1467
Citations number
6
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
In the Generalized Travelling Salesman Problem (GTSP), the aim is to d
etermine a least cost Hamiltonian circuit or cycle through several clu
sters of vertices. It is shown that a wide variety of combinatorial op
timization problems can be modelled as GTSPs. These problems include l
ocation-routeing problems, material flow system design, post-box colle
ction, stochastic vehicle routeing and are routeing.