Dynamic Truckload Pick-up and Delivery Problem with Time Windows

被引:0
作者
Zhou, C. F. [1 ]
机构
[1] Natl Univ Def Technol, Sch Social Sci & Humanities, Changsha 410074, Hunan, Peoples R China
来源
MANUFACTURING PROCESS AND EQUIPMENT, PTS 1-4 | 2013年 / 694-697卷
关键词
PDPTW; Dynamic; Truckload; Rolling horizon framework; VEHICLE;
D O I
10.4028/www.scientific.net/AMR.694-697.3558
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A rolling horizon framework for the dynamic assignment and sequencing of trucks to jobs consisting of picking up and delivering full truckloads when requests for service arise on a continuous basis. A mathematical formulation of the problem faced at each stage is presented; its solution allows for the dynamic reassignment of trucks to loads. Loads have associated time windows for pickup and delivery, and the objective function includes explicit penalty cost for not serving a particular load. A solution algorithm is presented and implemented, and computational results are presented.
引用
收藏
页码:3558 / 3561
页数:4
相关论文
共 6 条
[1]  
Borndörfer R, 2008, LECT NOTES ECON MATH, V600, P3
[2]   Public-transport vehicle scheduling with multi vehicle type [J].
Ceder, Avishai .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2011, 19 (03) :485-497
[3]   Parallel tabu search for real-time vehicle routing and dispatching [J].
Gendreau, M ;
Guertin, F ;
Potvin, JY ;
Taillard, É .
TRANSPORTATION SCIENCE, 1999, 33 (04) :381-390
[4]   Adaptive labeling algorithms for the dynamic assignment problem [J].
Powell, WB ;
Snow, W ;
Cheung, RK .
TRANSPORTATION SCIENCE, 2000, 34 (01) :50-66
[5]  
Reagan A. C., 1996, TRANSPORTATION TRAFF, P737
[6]  
REAGAN AC, 1998, TRANSPORT RES REC, V1645, P176