Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities

Location-routing problems (LRPs) with intra-route facilities have recently gained the attention of researchers and practitioners. Intra-route facilities are used in the context of city logistics or alternative fuel vehicle fleets to keep vehicles operational on routes. In this paper, we extend the LRP with intra-route facilities to handle so-called combined facilities at which different replenishment services are offered to visiting vehicles. We present an adaptive large neighborhood search which is enhanced by a lower bounding procedure that helps to efficiently explore promising facility configurations. We demonstrate the competitiveness of the algorithm on existing benchmark sets for the single-resource LRP with intra-route facilities. In addition, we design new benchmark sets to assess the impact of combined intra-route facilities in logistics networks. We find that combined facilities help to reduce both the overall costs of the operated logistics network and the fleet size.

[1]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[2]  Michel Gendreau,et al.  A unified solution framework for multi-attribute vehicle routing problems , 2014, Eur. J. Oper. Res..

[3]  Jean-Yves Potvin,et al.  An Exchange Heuristic for Routeing Problems with Time Windows , 1995 .

[4]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[5]  A. M. Benjamin,et al.  Metaheuristics for the waste collection vehicle routing problem with time windows , 2011 .

[6]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[7]  Dominik Goeke,et al.  The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations , 2014, Transp. Sci..

[8]  Guy Desaulniers,et al.  Heuristics for an oil delivery vehicle routing problem , 2010 .

[9]  Maria Grazia Speranza,et al.  A survey on two-echelon routing problems , 2015, Comput. Oper. Res..

[10]  Jorge E. Mendoza,et al.  The electric vehicle routing problem with non-linear charging functions , 2015 .

[11]  Harilaos N. Psaraftis,et al.  k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .

[12]  Byung-In Kim,et al.  Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms , 2007 .

[13]  Bülent Çatay,et al.  An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem , 2016, Comput. Oper. Res..

[14]  Qiang Meng,et al.  Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots , 2008, Math. Comput. Model..

[15]  Gilbert Laporte,et al.  50th Anniversary Invited Article - Goods Distribution with Electric Vehicles: Review and Research Perspectives , 2016, Transp. Sci..

[16]  Andreas Fink,et al.  Increasing the Mileage of Battery Electric Medium-Duty Vehicles: A Recipe for Competitiveness? , 2016 .

[17]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[18]  Emmanouil E. Zachariadis,et al.  A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities , 2008, INFORMS J. Comput..

[19]  André Langevin,et al.  The capacitated arc routing problem with refill points , 2007, Oper. Res. Lett..

[20]  Richard F. Hartl,et al.  The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations , 2013, Eur. J. Oper. Res..

[21]  Dominik Goeke,et al.  Routing a mixed fleet of electric and conventional vehicles , 2015, Eur. J. Oper. Res..

[22]  Gilbert Laporte,et al.  Battery degradation and behaviour for electric vehicles: Review and numerical analyses of several models , 2017 .

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

[24]  Gilbert Laporte,et al.  The multi-depot vehicle routing problem with inter-depot routes , 2007, Eur. J. Oper. Res..

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

[26]  Simona Mancini,et al.  The Hybrid Vehicle Routing Problem , 2017 .

[27]  Dominik Goeke,et al.  Solving the battery swap station location-routing problem with capacitated electric vehicles using an AVNS algorithm for vehicle-routing problems with intermediate stops , 2017 .

[28]  Julian Hof,et al.  An adaptive VNS algorithm for vehicle routing problems with intermediate stops , 2015, OR Spectr..

[29]  Peter Goos,et al.  A memetic algorithm for the travelling salesperson problem with hotel selection , 2013, Comput. Oper. Res..

[30]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[31]  Maximilian Schiffer,et al.  The electric location routing problem with time windows and partial recharging , 2017, Eur. J. Oper. Res..

[32]  Giovanni Righini,et al.  A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges , 2014 .

[33]  Ferdinando Pezzella,et al.  A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model , 2015, Comput. Oper. Res..

[34]  Elise Miller-Hooks,et al.  A Green Vehicle Routing Problem , 2012 .

[35]  Stefan Irnich,et al.  Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows , 2014, Oper. Res..

[36]  Bülent Çatay,et al.  Partial recharge strategies for the electric vehicle routing problem with time windows , 2016 .

[37]  Teodor Gabriel Crainic,et al.  Models for Evaluating and Planning City Logistics Systems , 2009, Transp. Sci..

[38]  Ferdinando Pezzella,et al.  A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows , 2015, Electron. Notes Discret. Math..

[39]  Dirk Cattrysse,et al.  A memetic algorithm for the orienteering problem with hotel selection , 2014, Eur. J. Oper. Res..

[40]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[41]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[42]  Maximilian Schiffer,et al.  An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities , 2018, Transp. Sci..

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

[44]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[45]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[46]  Maximilian Schiffer,et al.  Are ECVs breaking even? - Competitiveness of electric commercial vehicles in medium–duty logistics networks , 2016 .