Online algorithms for the vehicle scheduling problem with time objective

Authors:
Maolin Hu;Yinfeng Xu;Weijun Xu
Affiliations:
Department of Mathematics, Guyuan Teachers college, Guyuan, China;School of Management, Xi’an Jiaotong University, Xi’an, China;School of Management, Xi’an Jiaotong University, Xi’an, China
Venue:
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Year:
2005

Citing 5
Cited 0

Competitive algorithms for server problems

Journal of Algorithms
Shortest paths without a map

Theoretical Computer Science
The Canadian Traveller Problem

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A Graph-Theoretic Game and its Application to the $k$-Server Problem

SIAM Journal on Computing
On the k-server conjecture

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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.