| Article ID: | iaor19972417 |
| Country: | United Kingdom |
| Volume: | 47 |
| Issue: | 12 |
| Start Page Number: | 1461 |
| End Page Number: | 1467 |
| Publication Date: | Dec 1996 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Laporte Gilbert, Sriskandarajah Chelliah, Asef-Vaziri Ardavan |
| Keywords: | programming: travelling salesman |
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.