Dealing with Demand Uncertainty in Service Network and Load Plan Design

Less-than-Truckload (LTL) transportation carriers plan for their next operating season by deciding: (1) a load plan, which specifies how shipments are routed through the terminal network from origins to destinations, and (2) how many trailers to operate between each pair of terminals in the network. Most carriers also require that the load plan is such that shipments at an intermediate terminal and having the same ultimate destination are loaded onto trailers headed to a unique next terminal regardless of their origins. In practice, daily variations in demand are handled by relaxing this requirement and possibly loading shipments to an alternative next terminal. We introduce the p-alt model, which integrates routing and capacity decisions, and which allows p choices for the next terminal for shipments with a particular ultimate destination. We further introduce and computationally test three solution methods for the stochastic p-alt model, which shows that much can be gained from using the p-alt model and explicitly considering demand uncertainty.

[1]  Martin W. P. Savelsbergh,et al.  Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design , 2016, Transp. Sci..

[2]  Warren B. Powell,et al.  Shipment Routing Algorithms with Tree Constraints , 1992, Transp. Sci..

[3]  Panos M. Pardalos,et al.  A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure , 1999, Oper. Res. Lett..

[4]  Warren B. Powell,et al.  A Local Improvement Heuristic for the Design of Less-than-Truckload Motor Carrier Networks , 1986, Transp. Sci..

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

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

[7]  Michel Gendreau,et al.  Progressive hedging‐based metaheuristics for stochastic network design , 2011, Networks.

[8]  Teodor Gabriel Crainic,et al.  Multicommodity Capacitated Network Design , 1999 .

[9]  Teodor Gabriel Crainic,et al.  A metaheuristic for stochastic service network design , 2010, J. Heuristics.

[10]  Ahmad I. Jarrah,et al.  Large-Scale, Less-than-Truckload Service Network Design , 2009, Oper. Res..

[11]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[12]  Teodor Gabriel Crainic,et al.  A Study of Demand Stochasticity in Service Network Design , 2009, Transp. Sci..

[13]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..