Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
From MaRDI portal
Publication:4770207
DOI10.1145/321832.321847zbMath0283.90036OpenAlexW1992249619MaRDI QIDQ4770207
Publication date: 1974
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321832.321847
Related Items
The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm ⋮ 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 ⋮ Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries ⋮ Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems ⋮ On single courier problem ⋮ The multiple-robot assembly plan problem ⋮ Approximation algorithms for some vehicle routing problems ⋮ Sequential search and its application to vehicle-routing problems ⋮ The multiagent planning problem ⋮ Algorithms for the design of network topologies with balanced disjoint rings ⋮ On general routing problems ⋮ An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets ⋮ The optimum assignments and a new heuristic approach for the traveling salesman problem ⋮ Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks ⋮ An algorithm for the traveling salesman problem with pickup and delivery customers ⋮ A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
