Effective truckload dispatch decision methods with incomplete advance load information

We investigate the following question of relevance to truckload dispatchers striving for profitable decisions in the context of dynamic pick-up and delivery problems: ``since not all future pick-up/delivery requests are known with certainty (i.e., advance load information (ALI) is incomplete), how effective are alternative methods for guiding those decisions?'' We propose a simple intuitive policy and integrate it into a new two-index mixed integer programming formulation, which we implement using the rolling horizon approach. On average, in one of the practical transportation network settings studied, the proposed policy can, with just second-day ALI, yield an optimality ratio equal to almost 90 percent of profits in the static optimal solution (i.e., the solution with asymptotically complete ALI). We also observe from studying the policy that second-day load information is essential when a carrier operates in a large service area. We enhance the proposed policy by adopting the idea of a multiple scenario approach. With only one-day load information, the enhanced policy improves the ratio of optimality by an average of 6 percentage points. That improvement declines with more ALI. In comparison to other dispatching methods, our proposed policy and the enhanced version we developed were found to be very competitive in terms of solution quality and computational efficiency.

[1]  Warren B. Powell,et al.  An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application , 2009, Transp. Sci..

[2]  Warren B. Powell,et al.  On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance , 2000, Transp. Sci..

[3]  Richard F. Hartl,et al.  Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports , 2011, Comput. Oper. Res..

[4]  Michael A. Haughton,et al.  The benefit of advance load information for truckload carriers , 2014 .

[5]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[6]  Y. Sheffi,et al.  OPTIMIZATION‐BASED PROCUREMENT FOR TRANSPORTATION SERVICES , 2003 .

[7]  G. Griffin,et al.  THE DETERMINANTS OF JOB SATISFACTION OF PROFESSIONAL DRIVERS , 1990 .

[8]  Robert L. Smith,et al.  Infinite Horizon Production Scheduling in Time - Varying Systems Under Stochastic Demand , 2004, Oper. Res..

[9]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[10]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[11]  Martin W. P. Savelsbergh,et al.  Lane-Exchange Mechanisms for Truckload Carrier Collaboration , 2011, Transp. Sci..

[12]  Gary M. Kern,et al.  Master Production Rescheduling Policy in Capacity‐Constrained Just‐In‐Time Make‐To‐Stock Environments , 1996 .

[13]  Xiao Liu,et al.  Task Selection and Routing Problems In Collaborative Truckload Transportation , 2010 .

[14]  Kenneth S. Nickerson,et al.  Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and Operations , 1988 .

[15]  Chelsea C. White,et al.  Anticipatory Route Selection , 2004, Transp. Sci..

[16]  G. Don Taylor,et al.  Quantifying the value of advance load information in truckload trucking , 2006 .

[17]  Hani S. Mahmassani,et al.  IMPROVING EFFICIENCY OF COMMERCIAL VEHICLE OPERATIONS USING REAL-TIME INFORMATION: POTENTIAL USES AND ASSIGNMENT STRATEGIES , 1995 .

[18]  Tsung-Sheng Chang,et al.  Decision support for truckload carriers in one-shot combinatorial auctions , 2009 .

[19]  John E. Delery,et al.  An organization-level analysis of voluntary and involuntary turnover. , 1998 .

[20]  Xiao Liu,et al.  Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration , 2010, Comput. Oper. Res..

[21]  Hani S. Mahmassani,et al.  On-Line Algorithms for Truck Fleet Assignment and Scheduling Under Real-Time Information , 1999 .

[22]  Christian Bierwirth,et al.  Solutions to the request reassignment problem in collaborative carrier networks , 2010 .

[23]  Michel Gendreau,et al.  Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..

[24]  Hani S. Mahmassani,et al.  Evaluation of Dynamic Fleet Management Systems: Simulation Framework , 1998 .

[25]  Michael H. Cole,et al.  Empty container management for intermodal transportation networks , 2002 .

[26]  Michael A. Haughton,et al.  The benefit of information sharing in a logistics outsourcing context , 2012 .

[27]  Suresh P. Sethi,et al.  Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography , 2001, Manuf. Serv. Oper. Manag..

[28]  C. Caplice Electronic Markets for Truckload Transportation , 2007 .

[29]  Warren B. Powell,et al.  An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times , 2002, Transp. Sci..

[30]  Warren B. Powell,et al.  A Stochastic Model of the Dynamic Vehicle Allocation Problem , 1986, Transp. Sci..

[31]  Yoshinori Suzuki,et al.  Predicting truck driver turnover , 2009 .

[32]  James H. Bookbinder,et al.  IMPACT ON A TRUCKING COMPANY OF A CUSTOMER'S USE OF DISTRIBUTION REQUIREMENTS PLANNING , 1986 .

[33]  James H. Bookbinder,et al.  Rolling horizon production planning for probabilistic time-varying demands , 1986 .

[34]  Yossi Sheffi,et al.  Logistics Clusters: Delivering Value and Driving Growth , 2012 .

[35]  Thomas E. Morton,et al.  The Nonstationary Stochastic Lead-Time Inventory Problem: Near-Myopic Bounds, Heuristics, and Testing , 1996 .

[36]  Nicole Wieberneit,et al.  Service network design for freight transportation: a review , 2007, OR Spectr..

[37]  Teodor Gabriel Crainic,et al.  Service network design in freight transportation , 2000, Eur. J. Oper. Res..

[38]  Jian Yang,et al.  Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..

[39]  Genichi Taguchi,et al.  Taguchi methods : design of experiments , 1993 .

[40]  Gilbert Laporte,et al.  Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic , 2006, Transp. Sci..

[41]  Özlem Ergun,et al.  Allocating Costs in a Collaborative Transportation Procurement Network , 2008, Transp. Sci..

[42]  Warren B. Powell,et al.  THE DYNAMIC VEHICLE ALLOCATION PROBLEM WITH UNCERTAIN DEMANDS , 1987 .

[43]  Barrett W. Thomas Waiting Strategies for Anticipating Service Requests from Known Customer Locations , 2007, Transp. Sci..

[44]  Warren B. Powell,et al.  Chapter 5 Dynamic Models for Freight Transportation , 2007, Transportation.

[45]  Martin W. P. Savelsbergh,et al.  Shipper collaboration , 2007, Comput. Oper. Res..

[46]  Linos F. Frantzeskakis,et al.  A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems , 1990, Transp. Sci..

[47]  Martin W. P. Savelsbergh,et al.  Reducing Truckload Transportation Costs Through Collaboration , 2007, Transp. Sci..

[48]  Warren B. Powell,et al.  A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers , 1996, Transp. Sci..

[49]  Verena Schmid,et al.  Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming , 2012, Eur. J. Oper. Res..

[50]  Sridhar R. Tayur,et al.  Scheduling of Time-Shared Jet Aircraft , 1998, Transp. Sci..

[51]  Richard F. Hartl,et al.  New savings based algorithms for time constrained pickup and delivery of full truckloads , 2003, Eur. J. Oper. Res..

[52]  Scott B. Keller,et al.  DRIVER RELATIONSHIPS WITH CUSTOMERS AND DRIVER TURNOVER: KEY MEDIATING VARIABLES AFFECTING DRIVER PERFORMANCE IN THE FIELD , 2002 .