A dynamic vehicle routing problem with backhaul and time window

Author

Wang, Xuping ; Cao, Haiyan

Author_Institution

Inst. of Syst. Eng., Dalian Univ. of Technol., Dalian

Volume

1

fYear

2008

fDate

12-15 Oct. 2008

Firstpage

1256

Lastpage

1261

Abstract

The problem of demand changes in the vehicle routing problem with backhaul and time window is addressed in the paper. In real vehicle scheduling, customer demand often changes, such as new requests, requests of canceling service and increase/decrease in the quantity from backhauls. These make the original optimal plan unfeasible. In order to solve the problem, demand changes are analyzed, and their impact on the original plan is measured at first. And based on disruption management thoughts, a disruption recovery model for the problem is put forward. Then two strategies and a local search algorithm are designed to find the optimal adjusted solution. Finally, experimental results show the effectiveness of the model and the algorithm.

Keywords

goods distribution; search problems; disruption management; disruption recovery model; dynamic vehicle routing problem; local search algorithm; time window; vehicle scheduling; Algorithm design and analysis; Automotive engineering; Clustering algorithms; Jacobian matrices; Job shop scheduling; Logistics; Routing; Systems engineering and theory; Vehicle dynamics; Vehicles; a local search algorithm; demand change; disruption management; vehicle routing problem with backhaul and time window(VRPBTW);

fLanguage

English

Publisher

ieee

Conference_Titel

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-2012-4

Electronic_ISBN

978-1-4244-2013-1

Type

conf

DOI

10.1109/SOLI.2008.4686592

Filename

4686592