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 proceedingConference contribution

2 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010
Pages188-191
Number of pages4
Volume2
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 WASE International Conference on Information Engineering, ICIE 2010 - Beidaihe, Hebei, China
Duration: Aug 14 2010Aug 15 2010

Other

Other2010 WASE International Conference on Information Engineering, ICIE 2010
CountryChina
CityBeidaihe, Hebei
Period8/14/108/15/10

Fingerprint

Scheduling
Tabu search
Vehicle scheduling
Local search

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

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 (Vol. 2, pp. 188-191). [5571331] 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. Vol. 2 2010. p. 188-191 5571331.

Research output: Chapter in Book/Report/Conference proceedingConference 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. vol. 2, 5571331, 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
Lang M, Wang Y, Zhou X. A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem. In Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010. Vol. 2. 2010. p. 188-191. 5571331 https://doi.org/10.1109/ICIE.2010.140
Lang, Maoxiang ; Wang, Yanling ; Zhou, Xuesong. / A two-stage algorithm for a dynamic multi-trip vehicle scheduling problem. Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 2010. Vol. 2 2010. pp. 188-191
@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",
doi = "10.1109/ICIE.2010.140",
language = "English (US)",
isbn = "9780769540801",
volume = "2",
pages = "188--191",
booktitle = "Proceedings - 2010 WASE International Conference on Information Engineering, ICIE 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

Y1 - 2010

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

VL - 2

SP - 188

EP - 191

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

ER -