Anticipatory Planning for Courier, Express and Parcel Services

In recent years, the number of challenges for courier, express and parcel services has grown. Today, service providers deal with dynamic changes and uncertainty. Customers can request service at any point of time in the whole service region. Technologies like Global Positioning Systems allow a more detailed and dynamic routing. Furthermore, historical data can be used to anticipate future events. To tackle the new challenges and to utilize the new resources, we suggest modeling customer locations as spatial random variables. This allows a more detailed and therefore efficient routing and decision making. Nevertheless, it requires more complex methods to anticipate future demands, because the straightforward application of graph theoretical approaches is not possible. For an exemplary problem setting in the Euclidean Plane (EP), we introduce a new anticipatory cost benefit heuristic (CBH). Additionally, we adjust techniques of approximate dynamic programming (ADP) and compare the results of CBH and ADP with a myopic approach and an optimal ex post solution. Here, both ADP and CBH outperform the myopic approach.

[1]  Emilio Frazzoli,et al.  Adaptive and Distributed Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment , 2009, IEEE Transactions on Automatic Control.

[2]  Patrick Jaillet,et al.  Online traveling salesman problems with service flexibility , 2011, Networks.

[3]  Warren B. Powell,et al.  Approximate Dynamic Programming - Solving the Curses of Dimensionality , 2007 .

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  Jürgen Branke,et al.  Waiting Strategies for Dynamic Vehicle Routing , 2005, Transp. Sci..

[6]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[7]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

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

[9]  Munther A. Dahleh,et al.  Dynamic Traveling Repairperson Problem for dynamic systems , 2008, 2008 47th IEEE Conference on Decision and Control.

[10]  Leandros Tassiulas,et al.  Adaptive Routing on the Plane , 1996, Oper. Res..

[11]  Sandy Irani,et al.  On-Line Algorithms for the Dynamic Traveling Repair Problem , 2002, SODA '02.

[12]  Warren B. Powell,et al.  “Approximate dynamic programming: Solving the curses of dimensionality” by Warren B. Powell , 2007, Wiley Series in Probability and Statistics.

[13]  Emilio Frazzoli,et al.  Distributed and Adaptive Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment , 2009, ArXiv.

[14]  Leen Stougie,et al.  Competitive Algorithms for the On-line Traveling Salesman , 1995, WADS.

[15]  Warren B. Powell,et al.  Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley Series in Probability and Statistics) , 2007 .

[16]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

[17]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[18]  Patrick Jaillet,et al.  Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios , 2006, Transp. Sci..