Abstract
Urban package delivery by single vehicle can be modeled as online Steiner travelling salesman problem. This paper investigates the scenario that delay time of traffic congestion is certain and of real-time information to delivery vehicle, the vehicle can obtain specific delay time of traffic congestion just upon reaching an end vertex of the corresponding edge. Given a graph G = (V, E) and a subset D in V, the goal is to design a minimum-weight closed tour that departs from the depot s in D and returns to s after visiting each destination node in D at least once. When delivery vehicle encounters at most k times of traffic congestion, we first show \( min\left\{ {k + 1,\rho_{\Sigma } + 1} \right\} \) is a lower bound on competitive ratio for the problem, where \( \rho_{\Sigma } \) is the ratio compared sum of delay time of all congested edges with cost of optimal route. We further present an online algorithm for the problem with its competitive ratio proved to be very close to the lower bound.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Cornuéjols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33, 1–27 (1985)
Fleischmann, B.: A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21, 307–317 (1985)
Ratliff, H.D., Rosenthal, A.S.: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31, 507–521 (1983)
Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theor. Comput. Sci. 84, 127–150 (1991)
Orloff, C.S.: A fundamental problem in vehicle routing. Networks 4, 35–64 (1974)
De Koster, R., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: a literature review. Eur. J. Oper. Res. 182, 481–501 (2007)
Zhang, H., Tong, W., Xu, Y., Lin, G.: The Steiner traveling salesman problem with online edge blockages. Eur. J. Oper. Res. 243, 30–40 (2015)
Bar-Noy, A., Schieber, B.: The Canadian traveller problem. In: Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 261–270 (1991)
Westphal, S.: A note on the k-Canadian traveller problem. Inf. Process. Lett. 106, 87–89 (2015)
Fu, L.: An adaptive routing algorithm for in-vehicle route guidance systems with real-time information. Transp. Res. Part B 35(8), 749–765 (2001)
Bender, M., Westphal, S.: An optimal randomized online algorithm for the k-Canadian traveller problem on node-disjoint paths. J. Comb. Optim. 30(1), 87–96 (2015)
Liao, C.S., Huang, Y.: Generalized Canadian traveller problems. J. Comb. Optim. 29(4), 701–712 (2015)
Zhang, H., Tong, W., Xu, Y., Lin, G.: The Steiner traveling salesman problem with online advanced edge blockages. Comput. Oper. Res. 70, 26–38 (2016)
Acknowledgments
This work was partially supported by the NSFC (Grant No. 71601152), and China Postdoctoral Science Foundation (Grant No. 2016M592811).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Li, S., Xu, Y. (2018). Single Vehicle’s Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time. In: Chen, J., Lu, P. (eds) Frontiers in Algorithmics. FAW 2018. Lecture Notes in Computer Science(), vol 10823. Springer, Cham. https://doi.org/10.1007/978-3-319-78455-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-78455-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-78454-0
Online ISBN: 978-3-319-78455-7
eBook Packages: Computer ScienceComputer Science (R0)