Abstract
Given (i) a set of \(N+1\) vertices, that corresponds to N clients and 1 depot, (ii) the travel time between each pair of vertices and (iii) a number m of salespersons, the multiple traveling salesman problem consists in finding m tours such that, starting from the depot, all clients are visited in such a way that some objective function is minimized. The objective function we consider in this paper is the makespan. More precisely, the goal is to find m tours (one for each salesperson) that minimize the time elapsed from the beginning of the operation until the last salesman comes back to the depot. We take into account handling times, i.e., the time spent visiting each client, which we assume to be the same for all of them. We address the problem in the particular case where the depot-clients network is a spider, with the depot located at its center. We show that this case is NP-hard even for 2 salespersons. We also show structural properties of the optimal solutions. These properties allow us to devise a PTAS for minimizing the makespan. More precisely, a \((1+ \varepsilon )\)-approximation algorithm with running time \(N^{O(m / \varepsilon )}\).
Additional support from ANID via FONDEF IDeA I+D ID18I10250, PIA/Apoyo a Centros Científicos y Tecnológicos de Excelencia AFB170001, Fondecyt 1170021 and Fondecyt 1181180.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bao, X., Liu, Z.: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theor. Comput. Sci. 434, 1–10 (2012)
Amariah, B., Alice, P.: A framework for vehicle routing approximation schemes in trees. In: Workshop on Algorithms and Data Structures, pp. 112–125. Springer (2019)
Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)
Nicos, C.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University Pittsburgh Pa Management Sciences Research Group (1976)
Greg, N.F., Matthew, S.H., Chul, E.K.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178–193 (1978)
Michael, R.G., David, S.J.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1990)
Daya, G., Arvind, G., Ramesh, K.: A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times. Inf. Process. Lett. 86, 87–91 (2003)
Grötschel, M., Jünger, M., Reinelt, G.: Optimal control of plotting and drilling machines: a case study. Zeitschrift für Oper. Res. 35(1), 61–84 (1991)
Karuno, Y., Nagamochi, H.: A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 218–229. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44676-1_18
Karuno, Y., Nagamochi, H.: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Theor. Comput. Sci. 312(2–3), 267–280 (2004)
Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. Euro. J. Oper. Res. 59(3), 345–358 (1992)
Eugene, L.L.: The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics (1985)
Donald Ratliff, H., Arnon, S.R.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31(3), 507–521 (1983)
Liang, X., Zhou, X., Dongsheng, X.: Exact and approximation algorithms for the min-max k-traveling salesmen problem on a tree. Euro. J. Oper. Res. 227(2), 284–292 (2013)
Xu, Z., Xu, L.: Approximation algorithms for min-max path cover problems with service handling time. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 383–392. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10631-6_40
Wei, Y., Zhaohui, L.: Vehicle routing problems on a line-shaped network with release time constraints. Oper. Res. Lett. 37, 85–88 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Pérez-Escalona, P., Rapaport, I., Soto, J., Vidal, I. (2021). The Multiple Traveling Salesman Problem on Spiders. In: Bureš, T., et al. SOFSEM 2021: Theory and Practice of Computer Science. SOFSEM 2021. Lecture Notes in Computer Science(), vol 12607. Springer, Cham. https://doi.org/10.1007/978-3-030-67731-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-67731-2_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-67730-5
Online ISBN: 978-3-030-67731-2
eBook Packages: Computer ScienceComputer Science (R0)