Advanced routing for city logistics service providers based on time-dependent travel times

Abstract Increasing traffic demand, recurring congestion and sophisticated e-commerce business models lead to enormous challenges for routing in city logistics. We introduce a planning system for city logistics service providers, which faces those challenges by more realistic vehicle routing considering time-dependent travel times. Time-dependent travel times arise from telematics-based traffic data collection city-wide. Well-known heuristics for the Traveling Salesman Problem and for the Vehicle Routing Problem are adapted to time-dependent planning data. Computational experiments allow for insights into the efficiency of individual heuristics, their adaptability to time-dependent planning data sets, and the quality and structure of resulting delivery tours.

[1]  E. Voorde,et al.  Characteristics and Typology of Last-mile Logistics from an Innovation Perspective in an Urban Context , 2011 .

[2]  Richard Bishop,et al.  Intelligent Vehicle Technology and Trends , 2005 .

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

[4]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

[5]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

[6]  Jan Fabian Ehmke,et al.  Floating car based travel times for city logistics , 2012 .

[7]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[8]  Will Maden,et al.  A Road TimetableTM to aid vehicle routing and scheduling , 2006, Comput. Oper. Res..

[9]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[10]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[11]  Robert L. Smith,et al.  Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..

[12]  Miguel Figliozzi,et al.  A ROUTE IMPROVEMENT ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME DEPENDENT TRAVEL TIMES , 2009 .

[13]  Dorothea Wagner,et al.  Time-Dependent Route Planning , 2009, Encyclopedia of GIS.

[14]  Rolf H. Möhring,et al.  Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems , 2009, Robust and Online Large-Scale Optimization.

[15]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[16]  Martin Skutella,et al.  Time-Expanded Graphs for Flow-Dependent Transit Times , 2002, ESA.

[17]  Shashi Shekhar,et al.  Modeling Spatio-temporal Network Computations: A Summary of Results , 2007, GeoS.

[18]  Richard W. Eglese,et al.  Vehicle routing and scheduling with time-varying data: A case study , 2010, J. Oper. Res. Soc..

[19]  Jan Fabian Ehmke,et al.  Data chain management for planning in city logistics , 2009, Int. J. Data Min. Model. Manag..

[20]  Ariel Orda,et al.  Minimum weight paths in time-dependent networks , 1991, Networks.

[21]  Shashi Shekhar,et al.  Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results , 2005, SSTD.

[22]  Nico Vandaele,et al.  Vehicle routing with dynamic travel times: A queueing approach , 2008, Eur. J. Oper. Res..

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

[24]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[25]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[26]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[28]  Eiichi Taniguchi,et al.  CITY LOGISTICS. NETWORK MODELLING AND INTELLIGENT TRANSPORT SYSTEMS , 2001 .

[29]  Shashi Shekhar,et al.  Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results , 2007, SSTD.

[30]  Eiichi Taniguchi,et al.  Modelling City Logistics , 1999 .

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

[32]  Elisa Bertino,et al.  Advances in Spatial and Temporal Databases, 9th International Symposium, SSTD 2005, Angra dos Reis, Brazil, August 22-24, 2005, Proceedings , 2005, SSTD.

[33]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[34]  J. Schneider.  The time-dependent traveling salesman problem , 2002 .

[35]  Manuel Laguna,et al.  Tabu Search , 1997 .

[36]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .