Appointment scheduling and routing optimization of attended home delivery system with random customer behavior

Attended home delivery (AHD) has been identified as a crucial delivery mode of the last mile problem. As the name implies, AHD involves delivery of needed goods at the customer's doorsteps or nearby via walking or short-distance vehicle. Considering no-show and random response time, this article presents an integrative approach that combines appointment scheduling and vehicle routing problem with soft time windows. We also propose an intuitive heuristic dynamic programming to tackle the appointment scheduling problem whose optimal decision is expected to be very complicated, embed it into tabu search and formulate a hybrid heuristic algorithmto solve this integrative model. Moreover, an extension to hard time windows has also been discussed. Our results indicate that the integrative approach could lead to high-quality solutions in a reasonable amount of runtimeas compared to the hierarchical approach.

[1]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

[2]  Michel Gendreau,et al.  A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times , 2014, Eur. J. Oper. Res..

[3]  Stephen C. H. Leung,et al.  Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem , 2011, Comput. Oper. Res..

[4]  Andrew Lim,et al.  A Hybrid Search Algorithm for the Vehicle Routing Problem with Time Windows , 2001, Int. J. Artif. Intell. Tools.

[5]  F. Glover HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[6]  D. Simchi-Levi,et al.  The Logic of Logistics: Theory, Algorithms, and Applications for Logistics and Supply Chain Management , 1999 .

[7]  Wen-Chyuan Chiang,et al.  Scatter search for the vehicle routing problem with time windows , 2006, Eur. J. Oper. Res..

[8]  Brian T. Denton,et al.  Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand , 2013, INFORMS J. Comput..

[9]  B. Yu,et al.  A hybrid algorithm for vehicle routing problem with time windows , 2011, Expert Syst. Appl..

[10]  Zhenzhen Zhang,et al.  A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints , 2013, Eur. J. Oper. Res..

[11]  Hon-Shiang Lau,et al.  Minimizing total cost in scheduling outpatient appointments , 1992 .

[12]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[13]  Richard W. Eglese,et al.  A new tabu search heuristic for the open vehicle routing problem , 2005, J. Oper. Res. Soc..

[14]  Martin W. P. Savelsbergh,et al.  Incentive Schemes for Attended Home Delivery Services , 2006, Transp. Sci..

[15]  Karl F. Doerner,et al.  Examination and Operating Room Scheduling Including Optimization of Intrahospital Routing , 2014, Transp. Sci..

[16]  Stephen C. H. Leung,et al.  Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm , 2010 .

[17]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[18]  Jun Zhang,et al.  How to Choose “Last Mile” Delivery Modes for E-Fulfillment , 2014 .

[19]  Refael Hassin,et al.  Scheduling Arrivals to Queues: A Single-Server Model with No-Shows , 2008, Manag. Sci..

[20]  M. Teixeira,et al.  Robust Switched Control Design for Nonlinear Systems Using Fuzzy Models , 2014 .

[21]  Chung-Yee Lee,et al.  Machine scheduling with job delivery coordination , 2004, Eur. J. Oper. Res..

[22]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[23]  Mikael Rönnqvist,et al.  Combined vehicle routing and scheduling with temporal precedence and synchronization constraints , 2008, Eur. J. Oper. Res..

[24]  J. D. Welch,et al.  Appointment systems in hospital outpatient departments. , 1952, Lancet.

[25]  Paolo Toth,et al.  Vehicle Routing , 2014, Vehicle Routing.

[26]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[27]  Kumar Muthuraman,et al.  Sequential clinical scheduling with patient no-shows and general service time distributions , 2010 .

[28]  D. M. Topkis Supermodularity and Complementarity , 1998 .

[29]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[30]  Martin W. P. Savelsbergh,et al.  Time Slot Management in Attended Home Delivery , 2008, Transp. Sci..

[31]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

[32]  Andrew Lim,et al.  A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints , 2015, Eur. J. Oper. Res..

[33]  Adriana Felicia Gabor,et al.  The Time Window Assignment Vehicle Routing Problem , 2012, Transp. Sci..