scientific article; zbMATH DE number 4029299

From MaRDI portal
Publication:3770307





[For the entire collection see Zbl 0608.00016.] Posed in simple terms, the multiple travelling salesman problem (m-TSP) consists of determining m routes from a central depot to a set of geographically scattered cities in such a way that (i) all m routes start and end at the depot (city 1); (ii) every other city is visited exactly once; (iii) the total distance travelled is minimized. The algorithm presented in this paper tackles the m-TSP directly. It applies to several types of asymmetrical problems: m can be either fixed, free or bounded.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3770307)