Optimizing local pickup and delivery with uncertain loads

The local pickup and delivery problem (LPDP) is an essential operational problem in intermodal industry. While the problem with deterministic settings is already difficult to solve, in reality, there exist a set of loads, called uncertain loads, which are unknown at the beginning of the day. But customers may call in during the day to materialize these loads. In this paper, we call the LPDP considering these uncertain loads as the stochastic LPDP. The problem description and the mathematical modeling of stochastic LPDP are discussed. Then, a simulation-based optimization approach is proposed to solve the problem, which features in a fast solution generation procedure and an intelligent simulation budget allocation framework. The numerical examples show the best strategy to consider the stochastic loads in the planning process and validate the benefits compared to its deterministic counterpart.

[1]  IrnichStefan,et al.  Local Search for Vehicle Routing and Scheduling Problems , 2005 .

[2]  Warren B. Powell,et al.  Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management , 1998, Transp. Sci..

[3]  E K Morlok,et al.  REDESIGNING RAIL-TRUCK INTERMODAL DRAYAGE OPERATIONS FOR ENHANCED SERVICE AND COST PERFORMANCE , 1994 .

[4]  Martin W. P. Savelsbergh,et al.  Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..

[5]  Amelia C. Regan,et al.  Local truckload pickup and delivery with hard time window constraints , 2002 .

[6]  Chun-Hung Chen,et al.  Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization , 2000, Discret. Event Dyn. Syst..

[7]  Zhi-Long Chen,et al.  Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..

[8]  Maged M. Dessouky,et al.  An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[9]  Kamlesh Mathur,et al.  Vehicle Routing and Scheduling with Full Truckloads , 2003, Transp. Sci..

[10]  Tore Grünert,et al.  Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration , 2005, J. Heuristics.

[11]  Warren B. Powell,et al.  An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem , 2002, Transp. Sci..

[12]  Yetkin Ileri.  Dray Optimization in Truck/Rail Networks , 2007 .

[13]  Leyuan Shi,et al.  Hybrid Nested Partitions and Mathematical Programming Approach and Its Applications , 2008, IEEE Transactions on Automation Science and Engineering.

[14]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[15]  Alan L. Erera,et al.  Intermodal Drayage Routing and Scheduling , 2008 .

[16]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

[17]  Loo Hay Lee,et al.  Stochastic Simulation Optimization - An Optimal Computing Budget Allocation , 2010, System Engineering and Operations Research.