Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem

DOI10.1287/opre.36.1.163zbMath0643.90093OpenAlexW2044347866MaRDI QIDQ3786302

Ton Volgenant, Roy Jonker

Publication date: 1988

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.36.1.163

zbMATH Keywords

vehicle routingsymmetric, single-depot, multiple traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations, Transformation of multidepot multisalesmen problem to the standard travelling salesman problem, An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets, Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem