Towards an IT-based Planning Process Alignment: Integrated Route and Location Planning for Small Package Shippers

Competition in the logistics sector significantly increases driven by high cost pressure and new legal regulations. In particular, the new rules for CO2 emissions increase the pressure on logistics companies to improve their network efficiency. On the strategic level, the network efficiency of small package shippers (SPS) mainly depends on the locations of hubs and depots. Since customer demand as well as customer locations vary within the planning horizon of a strategic decision, which is about 10-15 years, a reasonable approximation of those values and a powerful planning tool are required.

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

[2]  Philippe Lacomme,et al.  A GRASP×ELS approach for the capacitated location-routing problem , 2010, Comput. Oper. Res..

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

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

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

[6]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[7]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[8]  Michael Schwind,et al.  Decision Support for Location Routing with Relocation Aspects , 2010, MKWI.

[9]  Michael Schwind,et al.  Ant Colony Optimization for a stochastic vehicle routing problem with driver learning , 2010, IEEE Congress on Evolutionary Computation.

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

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

[12]  Daniele Vigo,et al.  Graph Sparsification for the Vehicle Routing Problem with Time Windows , 2010, OR.

[13]  Gilbert Laporte,et al.  A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers , 2008, J. Oper. Res. Soc..

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

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

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

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

[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]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[20]  Michael Schwind,et al.  A Vehicle Routing Problem with Time Windows and Driver Familiarity , 2010 .

[21]  Angel B. Ruiz,et al.  Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic , 2007, Transp. Sci..

[22]  Daniele Vigo,et al.  Location Routing for Small Package Shippers with Subcontracting Options , 2012 .

[23]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[24]  Jean-Yves Potvin,et al.  Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier , 2011, J. Oper. Res. Soc..

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

[26]  Jean-Yves Potvin,et al.  A tabu search heuristic for the vehicle routing problem with private fleet and common carrier , 2009, Eur. J. Oper. Res..