Operational flexibility in the truckload trucking industry

被引:15
作者
Zolfagharinia, Hossein [1 ]
Haughton, Michael A. [2 ]
机构
[1] Ryerson Univ, Ted Rogers Sch Management, 575 Bay St, Toronto, ON, Canada
[2] Wilfrid Laurier Univ, Lazaridis Sch Business & Econ, 75 Univ Ave, Waterloo, ON, Canada
关键词
Vehicle diversion; Re-optimization; Advance load information; Truckload operations; Time windows discretization; Mixed integer programming; ADVANCE LOAD INFORMATION; SERVICE NETWORK DESIGN; FREIGHT TRANSPORTATION; ROUTING-PROBLEMS; TIME WINDOWS; COLLABORATION; DELIVERY; PICKUP; PROCUREMENT; HEURISTICS;
D O I
10.1016/j.trb.2017.08.003
中图分类号
F [经济];
学科分类号
02 ;
摘要
Inspired by a real-life logistics provider, this study addresses a dynamic pickup and delivery problem with full truckload (DPDFL) for local operators. The primary purpose of this work is to investigate the impact of potential factors on the carriers' operational efficiency. These factors, which are typically under managerial influence, are vehicle diversion capability, the DPDFL decision interval, and how far in advance the carrier knows of the clients' shipment requirements (i.e., advance load information (ALI)). Through comprehensive numerical experiments and statistical analysis, we found that the ALI and decision interval significantly influence the total cost, however, the diversion capability does not. The findings also reveal that the impact of the re-optimization interval depends on the subcontracting cost and the amount of advance load information provided. A major contribution of this work is the development of an efficient benchmark solution for the static version of the DPDFL through the discretization of time windows. We observed that using three-day ALI and an appropriate decision interval can reduce deviation from the benchmark solution to less than 8%. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:437 / 460
页数:24
相关论文
共 49 条
[11]   A SUCCESSIVE LINEAR-APPROXIMATION PROCEDURE FOR STOCHASTIC, DYNAMIC VEHICLE ALLOCATION PROBLEMS [J].
FRANTZESKAKIS, LF ;
POWELL, WB .
TRANSPORTATION SCIENCE, 1990, 24 (01) :40-57
[12]   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
[13]   An adaptive dynamic programming algorithm for dynamic fleet management, I: Single period travel times [J].
Godfrey, GA ;
Powell, WB .
TRANSPORTATION SCIENCE, 2002, 36 (01) :21-39
[14]   A COMPARISON OF HEURISTICS FOR A SCHOOL BUS SCHEDULING PROBLEM [J].
GRAHAM, D ;
NUTTLE, HLW .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1986, 20 (02) :175-182
[15]   Exploiting knowledge about future demands for real-time vehicle dispatching [J].
Ichoua, Soumia ;
Gendreau, Michel ;
Potvin, Jean-Yves .
TRANSPORTATION SCIENCE, 2006, 40 (02) :211-225
[16]   Online routing problems: Value of advanced information as improved competitive ratios [J].
Jaillet, Patrick ;
Wagner, Michael R. .
TRANSPORTATION SCIENCE, 2006, 40 (02) :200-210
[17]   Scheduling of time-shared jet aircraft [J].
Keskinocak, P ;
Tayur, S .
TRANSPORTATION SCIENCE, 1998, 32 (03) :277-294
[18]  
Levin A., 1971, TRANSPORT SCI, V5, P232, DOI [10.1287/trsc.5.3.232, DOI 10.1287/TRSC.5.3.232]
[19]   Task selection and routing problems in collaborative truckload transportation [J].
Liu, Ran ;
Jiang, Zhibin ;
Liu, Xiao ;
Chen, Feng .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (06) :1071-1085
[20]   Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration [J].
Liu, Ran ;
Jiang, Zhibin ;
Fung, Richard Y. K. ;
Chen, Feng ;
Liu, Xiao .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (05) :950-959