Abstract
We consider a generalization of the well-known Traveling Salesman Problem, called the Vehicle Scheduling Problem (VSP), in which each city is associated with a release time and a service time. The salesman has to visit each city at or after its release time. Our main results are three-fold. First, we devise an approximation algorithm for VSP with performance ratio less than 5/2 when the number of distinct release times is fixed, improving the previous algorithm proposed by Nagamochi et al. [12]. Then we analyze a natural class of algorithms and show that no performance ratio better than 5/2 is possible unless the Metric TSP can be approximated with a ratio strictly less than 3/2, which is a well-known longstanding open question. Finally, we consider a special case of VSP, that has a heavy edge, and present an approximation algorithm with performance ratio less than 5/2 as well.
Research supported in part by NSFC (10971192).
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
Preview
Unable to display preview. Download preview PDF.
References
An, H.-C., Kleinberg, R., Shmoys, D.B.: Improving Christofides’ Algorithm for the s-t path TSP. In: the Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 875–886 (2012)
Augustine, J.E., Seiden, S.: Linear time approximation schemes for vehicle scheduling problems. Theoretical Computer Science 324, 147–160 (2004)
Bao, X., Liu, Z.: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theoretical Computer Science 434, 1–10 (2012)
Bhattacharya, B., Carmi, P., Hu, Y., Shi, Q.: Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 800–811. Springer, Heidelberg (2008)
Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1976)
Engebretsen, L., Karpinski, M.: TSP with bounded metrics. Journal of Computer and System Sciences 72, 509–546 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
Gaur, D.R., Gupta, A., Krishnamurti, R.: A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times. Information Processing Letters 86, 87–91 (2003)
Hoogeveen, J.A.: Analysis of Christofide’s heuristic: some paths are more difficult than cycles. Operations Research Letters 10, 291–295 (1991)
Karuno, Y., Nagamochi, H., Ibaraki, T.: A 1.5-approximation for single vehicle scheduling problem on a line with release and handling times. In: Proceedings of ISCIE/ASME 1998 Japan-USA Symposium on Flexible Automation, vol. 3, pp. 1363–1368 (1998)
Karuno, Y., Nagamochi, H.: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Theoretical Computer Science 312, 267–280 (2004)
Nagamochi, H., Mochizuki, K., Ibaraki, T.: Complexity of the single vehicle scheduling problems on graphs. Information Systems and Operations Research 35, 256–276 (1997)
Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the Association for Computing Machinery 23, 555–565 (1976)
Trevisan, L.: When Hamming meets Euclid: the approximability of geometric TSP and Steiner tree. SIAM Journal on Computing 30, 475–485 (2000)
Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22, 263–282 (1992)
Yu, W., Liu, Z.: Single-vehicle scheduling problems with release and service times on a line. Networks 57, 128–134 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, W., Golin, M., Zhang, G. (2012). Vehicle Scheduling on a Graph Revisited. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)