The two echelon open location routing problem: Mathematical model and hybrid heuristic

Abstract Multi echelon distribution systems have become more common in recent years. This paper addresses the two echelon open location routing problem (2E-OLRP) which is a variant of the two echelon location routing problem (2E-LRP). This problem seeks to find a minimum-cost set of vehicle routes that do not return to the depot in the first echelon and do not return to satellites in the second echelon due to the presence of individual contractors and third party logistics (3PL) providers. In spite of the large amount of research on LRPs, the 2E-OLRP has received very little attention. Three flow-based mixed-integer linear programs and a hybrid heuristic algorithm are proposed to deal with this problem. Extensive experiments evaluate the effectiveness of these methods.

[1]  Zhibin Jiang,et al.  The close-open mixed vehicle routing problem , 2012, Eur. J. Oper. Res..

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

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Oli B.G. Madsen,et al.  Methods for solving combined two level location-routing problems of realistic dimensions , 1983 .

[5]  Wen-Chyuan Chiang,et al.  A simulation/metaheuristic approach to newspaper production and distribution supply chain problems , 2009 .

[6]  Stefan Voß,et al.  An improved formulation for the multi-depot open vehicle routing problem , 2016, OR Spectr..

[7]  A. H. Gill.  The Industrial and Artistic Technology of Paint and Varnish , 1904 .

[8]  Oli B.G. Madsen,et al.  A comparative study of heuristics for a two-level routing-location problem , 1980 .

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

[10]  Christian Prins,et al.  A survey of recent research on location-routing problems , 2014, Eur. J. Oper. Res..

[11]  F. Altiparmak,et al.  The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach , 2012 .

[12]  Zhibin Jiang,et al.  A hybrid genetic algorithm for the multi-depot open vehicle routing problem , 2012, OR Spectrum.

[13]  R. Tavakkoli-Moghaddam,et al.  A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization , 2012 .

[14]  Panagiotis P. Repoussis,et al.  The open vehicle routing problem with time windows , 2007, J. Oper. Res. Soc..

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

[16]  Shin-Yu Lin,et al.  A simulated annealing heuristic for the open location-routing problem , 2015, Comput. Oper. Res..

[17]  José Brandão,et al.  A tabu search algorithm for the open vehicle routing problem , 2004, Eur. J. Oper. Res..

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

[19]  Said Salhi,et al.  The effect of ignoring routes when locating depots , 1989 .

[20]  Christian Prins,et al.  Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking , 2012, Eur. J. Oper. Res..

[21]  Teodor Gabriel Crainic,et al.  Lower and upper bounds for the two-echelon capacitated location-routing problem , 2012, Comput. Oper. Res..

[22]  Daniele Vigo,et al.  The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics , 2011, Transp. Sci..

[23]  Michael Drexl,et al.  A survey of variants and extensions of the location-routing problem , 2015, Eur. J. Oper. Res..

[24]  Zhibin Jiang,et al.  A memetic algorithm for the open capacitated arc routing problem , 2013 .

[25]  Panagiotis P. Repoussis,et al.  A hybrid evolution strategy for the open vehicle routing problem , 2010, Comput. Oper. Res..

[26]  Stefan Spinler,et al.  Enabling Urban Logistics Services at La Poste through Multi-Echelon Location-Routing , 2016, Transp. Sci..

[27]  Christian Prins,et al.  A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem , 2012, Eng. Appl. Artif. Intell..

[28]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

[29]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[30]  Nenad Bjelic,et al.  A two-echelon location-routing model for designing recycling logistics networks with profit: MILP and heuristic approach , 2016, Expert Syst. Appl..

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

[32]  S. A. MirHassani,et al.  A particle swarm optimization algorithm for open vehicle routing problem , 2011, Expert Syst. Appl..

[33]  Laura I. Burke,et al.  A two-phase tabu search approach to the location routing problem , 1999, Eur. J. Oper. Res..

[34]  Paolo Toth,et al.  An ILP improvement procedure for the Open Vehicle Routing Problem , 2008, Comput. Oper. Res..

[35]  Ahmad Makui,et al.  Modeling and solving the bi-objective capacitated location-routing problem with probabilistic travel times , 2013 .

[36]  Wen-Chyuan Chiang,et al.  Integrating multi-product production and distribution in newspaper logistics , 2008, Comput. Oper. Res..

[37]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[38]  Parida Jewpanya,et al.  Open vehicle routing problem with cross-docking , 2016, Comput. Ind. Eng..

[39]  Jenn-Rong Lin,et al.  Distribution systems design with two-level routing considerations , 2009, Ann. Oper. Res..