Abstract
Falling across the problem of the unforeseen congested events in the logistic transportation, we build the online vehicle scheduling model with the recoverable congested vertices in this paper. Our optimization objective minimizes the total time of online scheduling. Considering the dynamic occurrence characteristics of the congested vertices one by one, we first introduce three online scheduling strategies, i. e., Greedy Strategy, Reposition Strategy, and Waiting Strategy, and analyze the advantages and disadvantages of competitive performances of the three strategies. Then we propose the Simple Choice Strategy. By competitive performance analysis, we think that the Simple Choice Strategy could be an optimal scheduling scheme for online vehicle transportation.
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
Bar-noy, A., Schieber, B.: The canadian traveler problem. In: Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, pp. 261–270 (1991)
David, S.B., Borodin, A.: A new measure for the study of the on-line algorithm. Algorithmica 11(1), 73–91 (1994)
Du, D.Z.: k-server problem and competitive algorithms. Mathematics in Practice and Theory (4), 36–40 (1991) (in chinese)
Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. Journal of Algorithms 11(2), 208–230 (1990)
Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. Journal of ACM 42(5), 971–983 (1995)
Alon, N., Karp, P.M., Peleg, D., et al.: A graph-theoretic game and its application to the k-server problem. SIAM Journal on Computing 24(1), 78–100 (1995)
Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science 84, 127–150 (1991)
Pinnoi, A., Tung, D.T.: Vehicle routing-scheduling for waste collection in Hanoi. European Journal of Operational Research 125(3), 449–468 (2000)
Woeginger, G.J.: Open problems in the theory of scheduling. Bulletin of the EATCS 76, 67–83 (2002)
Zhu, Z.J., Xu, Y.F., Lü, C.C.: Scheduling for on-line routing problem and its competitive strategy analysis. Journal of Systems Engineering 18(4), 324–330 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, M., Xu, Y., Xu, W. (2005). Online Algorithms for the Vehicle Scheduling Problem with Time Objective. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_57
Download citation
DOI: https://doi.org/10.1007/11600930_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)