Territory-Based Vehicle Routing in the Presence of Time-Window Constraints

Territory-based routing approaches TBRAs are commonly used to achieve high service consistency, e.g., in the small package shipping industry, but their drawback is a decline in routing flexibility. Consequently, a high percentage of time-definite deliveries, as common in the small package shipping sector, should have a significant negative effect on the solution quality of TBRAs. To the best of our knowledge, no study exists on the magnitude of this effect and the factors that influence it. Therefore, we develop a two-phase TBRA and use it i to investigate the design requirements of a TBRA for successfully handling time windows, and ii to study the influence of time window constraints on the performance of such an approach. We find that the consideration of geographical aspects in the districting is paramount for generating high-quality territories, whereas explicitly incorporating time window characteristics and historical demand data does not lead to a perceptible improvement of the solution quality. Moreover, the efficiency and feasibility forfeits of our TBRA in comparison to daily route reoptimization RR are larger if time windows are present. However, significantly higher consistency improvements compared to RR are achieved for time-constrained problems. This is due to the fact that RR solutions to time-definite problems exhibit lower consistency and thus a higher potential for improvement by using a TBRA, which constitutes an important insight for practitioners.

[1]  Barrett W. Thomas,et al.  Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines , 2009, Comput. Oper. Res..

[2]  Maciek Nowak,et al.  Workforce Management in Periodic Delivery Operations , 2013, Transp. Sci..

[3]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

[4]  Nicos Christofides Fixed routes and areas for delivery operations , 1971 .

[5]  Randolph W. Hall,et al.  Territory Planning and Vehicle Dispatching with Driver Learning , 2007, Transp. Sci..

[6]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .

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

[8]  Michel Gendreau,et al.  Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography , 2008 .

[9]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[10]  Julián Molina Luque,et al.  Multiobjective scatter search for a commercial territory design problem , 2012, Ann. Oper. Res..

[11]  Yanfeng Ouyang,et al.  Design of vehicle routing zones for large-scale distribution systems , 2007 .

[12]  Zbigniew J. Czech,et al.  A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows , 2012, 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems.

[13]  Toshihide Ibaraki,et al.  An iterated local search algorithm for the vehicle routing problem with convex time penalty functions , 2008, Discret. Appl. Math..

[14]  Michael Schneider,et al.  The vehicle-routing problem with time windows and driver-specific times , 2016, Eur. J. Oper. Res..

[15]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[16]  Hermann Gehring,et al.  A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .

[17]  Gilbert Laporte,et al.  Designing delivery districts for the vehicle routing problem with stochastic demands , 2007, Eur. J. Oper. Res..

[18]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[19]  Andrew Lim,et al.  A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows , 2007, INFORMS J. Comput..

[20]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[21]  H. O'Brien,et al.  Distribution models and transport planning , 1975 .

[22]  Christos D. Tarantilis,et al.  Solving Large-Scale Vehicle Routing Problems with Time Windows: The State-of-the-Art , 2010 .

[23]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[24]  Bruce L. Golden,et al.  The Consistent Vehicle Routing Problem , 2009, Manuf. Serv. Oper. Manag..

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

[26]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[27]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[28]  Michel Gendreau,et al.  A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..

[29]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009, Networks.

[30]  John E. Beasley,et al.  Vehicle routing using fixed delivery areas , 1984 .

[31]  Michael A. Haughton The efficacy of exclusive territory assignments to delivery vehicle drivers , 2008, Eur. J. Oper. Res..

[32]  Richard T. Wong Vehicle Routing for Small Package Delivery and Pickup Services , 2008 .

[33]  Alan L. Erera,et al.  DESIGN OF LARGE-SCALE LOGISTICS SYSTEMS FOR UNCERTAIN ENVIRONMENTS , 2001 .

[34]  Michael Schneider,et al.  A note on the time travel approach for handling time windows in vehicle routing problems , 2013, Comput. Oper. Res..

[35]  Brian Kallehauge,et al.  Formulations and exact algorithms for the vehicle routing problem with time windows , 2008, Comput. Oper. Res..

[36]  Maged M. Dessouky,et al.  A Model and Algorithm for the Courier Delivery Problem with Uncertainty , 2010, Transp. Sci..

[37]  Gilbert Laporte,et al.  Consistency in multi-vehicle inventory-routing , 2012 .

[38]  J. E. Beasley Fixed Routes , 1984 .

[39]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[40]  Daniele Vigo,et al.  An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping , 2013, Transp. Sci..

[41]  U Aickelin,et al.  Handbook of metaheuristics (International series in operations research and management science) , 2005 .

[42]  Chuck Holland,et al.  Industrial Engineering Applications in Transportation , 2007 .

[43]  John Gunnar Carlsson,et al.  Dividing a Territory Among Several Vehicles , 2012, INFORMS J. Comput..

[44]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[45]  Carlos F. Daganzo,et al.  On Planning and Design of Logistics Systems for Uncertain Environments , 1999 .