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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Hu, M., Xu, Y., & Xu, W. (2005). Online algorithms for the vehicle scheduling problem with time objective. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3828 LNCS, pp. 574–583). https://doi.org/10.1007/11600930_57
Mendeley helps you to discover research relevant for your work.