A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem

Maoxiang Lang; Yanling Wang; Xuesong Zhou

doi:10.1109/ICIE.2010.140

A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem

Maoxiang Lang, Yanling Wang, Xuesong Zhou

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

4 Scopus citations

Abstract

Based on the analysis on the dynamic factors of vehicles in distribution services, a new dynamic multi-trip vehicle scheduling problem which considers vehicles' dynamic conditions and multi-trip distribution is presented. A two-stage solving strategy for the problem, i.e., the first stage for making distribution plan and the second stage for real time scheduling is addressed. Then a two-stage algorithm for the problem, i.e., the first stage using tabu search algorithm and the second stage using local search algorithm is developed. Thus both the powerful global searching capability of tabu search algorithm and the high converging speed of local search algorithm are made full use of. The effectiveness of this algorithm is demonstrated by experimental computations.

Original language	English (US)
Title of host publication	Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010
Pages	188-191
Number of pages	4
DOIs	https://doi.org/10.1109/ICIE.2010.140
State	Published - Nov 5 2010
Externally published	Yes
Event	2010 WASE International Conference on Information Engineering, ICIE 2010 - Beidaihe, Hebei, China Duration: Aug 14 2010 → Aug 15 2010

Publication series

Name	Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010
Volume	2

Other

Other	2010 WASE International Conference on Information Engineering, ICIE 2010
Country/Territory	China
City	Beidaihe, Hebei
Period	8/14/10 → 8/15/10

Keywords

Dynamic vehicle scheduling problem
Local search algorithm
Multi-trip vehicle routing problem
Tabu search algorithm
Vehicle routing problem

ASJC Scopus subject areas

Information Systems
Information Systems and Management

Access to Document

10.1109/ICIE.2010.140

Cite this

Lang, M., Wang, Y., & Zhou, X. (2010). A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem. In Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010 (pp. 188-191). Article 5571331 (Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010; Vol. 2). https://doi.org/10.1109/ICIE.2010.140

A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem. / Lang, Maoxiang; Wang, Yanling; Zhou, Xuesong.
Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010. 2010. p. 188-191 5571331 (Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010; Vol. 2).

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

Lang, M, Wang, Y & Zhou, X 2010, A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem. in Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010., 5571331, Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010, vol. 2, pp. 188-191, 2010 WASE International Conference on Information Engineering, ICIE 2010, Beidaihe, Hebei, China, 8/14/10. https://doi.org/10.1109/ICIE.2010.140

@inproceedings{e7261d42f5ec45968f751692e08c96b8,

title = "A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem",

abstract = "Based on the analysis on the dynamic factors of vehicles in distribution services, a new dynamic multi-trip vehicle scheduling problem which considers vehicles' dynamic conditions and multi-trip distribution is presented. A two-stage solving strategy for the problem, i.e., the first stage for making distribution plan and the second stage for real time scheduling is addressed. Then a two-stage algorithm for the problem, i.e., the first stage using tabu search algorithm and the second stage using local search algorithm is developed. Thus both the powerful global searching capability of tabu search algorithm and the high converging speed of local search algorithm are made full use of. The effectiveness of this algorithm is demonstrated by experimental computations.",

keywords = "Dynamic vehicle scheduling problem, Local search algorithm, Multi-trip vehicle routing problem, Tabu search algorithm, Vehicle routing problem",

author = "Maoxiang Lang and Yanling Wang and Xuesong Zhou",

year = "2010",

month = nov,

day = "5",

doi = "10.1109/ICIE.2010.140",

language = "English (US)",

isbn = "9780769540801",

series = "Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010",

pages = "188--191",

booktitle = "Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010",

note = "2010 WASE International Conference on Information Engineering, ICIE 2010 ; Conference date: 14-08-2010 Through 15-08-2010",

}

TY - GEN

T1 - A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem

AU - Lang, Maoxiang

AU - Wang, Yanling

AU - Zhou, Xuesong

PY - 2010/11/5

Y1 - 2010/11/5

N2 - Based on the analysis on the dynamic factors of vehicles in distribution services, a new dynamic multi-trip vehicle scheduling problem which considers vehicles' dynamic conditions and multi-trip distribution is presented. A two-stage solving strategy for the problem, i.e., the first stage for making distribution plan and the second stage for real time scheduling is addressed. Then a two-stage algorithm for the problem, i.e., the first stage using tabu search algorithm and the second stage using local search algorithm is developed. Thus both the powerful global searching capability of tabu search algorithm and the high converging speed of local search algorithm are made full use of. The effectiveness of this algorithm is demonstrated by experimental computations.

AB - Based on the analysis on the dynamic factors of vehicles in distribution services, a new dynamic multi-trip vehicle scheduling problem which considers vehicles' dynamic conditions and multi-trip distribution is presented. A two-stage solving strategy for the problem, i.e., the first stage for making distribution plan and the second stage for real time scheduling is addressed. Then a two-stage algorithm for the problem, i.e., the first stage using tabu search algorithm and the second stage using local search algorithm is developed. Thus both the powerful global searching capability of tabu search algorithm and the high converging speed of local search algorithm are made full use of. The effectiveness of this algorithm is demonstrated by experimental computations.

KW - Dynamic vehicle scheduling problem

KW - Local search algorithm

KW - Multi-trip vehicle routing problem

KW - Tabu search algorithm

KW - Vehicle routing problem

UR - http://www.scopus.com/inward/record.url?scp=78049325860&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049325860&partnerID=8YFLogxK

U2 - 10.1109/ICIE.2010.140

DO - 10.1109/ICIE.2010.140

M3 - Conference contribution

AN - SCOPUS:78049325860

SN - 9780769540801

T3 - Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010

SP - 188

EP - 191

BT - Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010

T2 - 2010 WASE International Conference on Information Engineering, ICIE 2010

Y2 - 14 August 2010 through 15 August 2010

ER -

A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this