Online algorithms for the vehicle scheduling problem with time objective

Maolin Hu; Yinfeng Xu; Weijun Xu

doi:10.1007/11600930_57

Online algorithms for the vehicle scheduling problem with time objective

Maolin Hu
, Yinfeng Xu
, Weijun Xu

School of Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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.

Original language	English
Title of host publication	Internet and Network Economics - First International Workshop, WINE 2005, Proceedings
Pages	574-583
Number of pages	10
DOIs	https://doi.org/10.1007/11600930_57
State	Published - 2005
Event	1st International Workshop on Internet and Network Economics, WINE 2005 - Hong Kong, China Duration: 15 Dec 2005 → 17 Dec 2005

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3828 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st International Workshop on Internet and Network Economics, WINE 2005
Country/Territory	China
City	Hong Kong
Period	15/12/05 → 17/12/05

Access to Document

10.1007/11600930_57

Cite this

Hu, M., Xu, Y., & Xu, W. (2005). Online algorithms for the vehicle scheduling problem with time objective. In Internet and Network Economics - First International Workshop, WINE 2005, Proceedings (pp. 574-583). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3828 LNCS). https://doi.org/10.1007/11600930_57

@inproceedings{239bf2bb4c8e4076900915a8c5caae20,

title = "Online algorithms for the vehicle scheduling problem with time objective",

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.",

author = "Maolin Hu and Yinfeng Xu and Weijun Xu",

year = "2005",

doi = "10.1007/11600930\_57",

language = "英语",

isbn = "3540309004",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "574--583",

booktitle = "Internet and Network Economics - First International Workshop, WINE 2005, Proceedings",

note = "1st International Workshop on Internet and Network Economics, WINE 2005 ; Conference date: 15-12-2005 Through 17-12-2005",

}

Hu, M, Xu, Y & Xu, W 2005, Online algorithms for the vehicle scheduling problem with time objective. in Internet and Network Economics - First International Workshop, WINE 2005, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3828 LNCS, pp. 574-583, 1st International Workshop on Internet and Network Economics, WINE 2005, Hong Kong, China, 15/12/05. https://doi.org/10.1007/11600930_57

Online algorithms for the vehicle scheduling problem with time objective. / Hu, Maolin; Xu, Yinfeng; Xu, Weijun.
Internet and Network Economics - First International Workshop, WINE 2005, Proceedings. 2005. p. 574-583 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3828 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Online algorithms for the vehicle scheduling problem with time objective

AU - Hu, Maolin

AU - Xu, Yinfeng

AU - Xu, Weijun

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33744946533

U2 - 10.1007/11600930_57

DO - 10.1007/11600930_57

M3 - 会议稿件

AN - SCOPUS:33744946533

SN - 3540309004

SN - 9783540309000

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 574

EP - 583

BT - Internet and Network Economics - First International Workshop, WINE 2005, Proceedings

T2 - 1st International Workshop on Internet and Network Economics, WINE 2005

Y2 - 15 December 2005 through 17 December 2005

ER -

Online algorithms for the vehicle scheduling problem with time objective

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this