×

zbMATH — the first resource for mathematics

Some applications of the generalized travelling salesman problem. (English) Zbl 0873.90104
Summary: 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.

MSC:
90C35 Programming involving graphs or networks
90B06 Transportation, logistics and supply chain management
PDF BibTeX XML Cite
Full Text: DOI