Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery

In this paper, we consider a variant of the many-to-many location-routing problem, where hub facilities have to be located and customers with either pickup or delivery demands have to be combined in vehicle routes. In addition, several commodities and inter-hub transport processes are taken into account. A practical application of the problem can be found in the timber-trade industry, where companies provide their services using hub-and-spoke networks. We present a mixed-integer linear model for the problem and use CPLEX 12.4 to solve small-scale instances. Furthermore, a multi-start procedure based on a fix-and-optimize scheme and a genetic algorithm are introduced that efficiently construct promising solutions for medium- and large-scale instances. A computational performance analysis shows that the presented methods are suitable for practical application.

[1]  Juan José Salazar González,et al.  The multi‐commodity pickup‐and‐delivery traveling salesman problem , 2014, Networks.

[2]  Maria Grazia Scutellà,et al.  Distribution network design: New problems and related models , 2005, Eur. J. Oper. Res..

[3]  Rafael Caballero,et al.  Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia , 2007, Eur. J. Oper. Res..

[4]  José Pinto Paixão,et al.  Using clustering analysis in a capacitated location-routing problem , 2007, Eur. J. Oper. Res..

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

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

[7]  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..

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

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

[10]  Caroline Prodhon,et al.  A hybrid evolutionary algorithm for the periodic location-routing problem , 2011, Eur. J. Oper. Res..

[11]  Jean-François Cordeau,et al.  An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem , 2014, INFORMS J. Comput..

[12]  Nader Azad,et al.  Incorporating location, routing and inventory decisions in supply chain network design , 2010 .

[13]  Andreas T. Ernst,et al.  Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem , 1998 .

[14]  Jean-François Cordeau,et al.  A computational comparison of flow formulations for the capacitated location-routing problem , 2013, Discret. Optim..

[15]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

[16]  Byung Ha Lim,et al.  A hub location problem in designing digital data service networks: Lagrangian relaxation approach , 1996 .

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

[18]  Günther Raidl,et al.  Evolutionary Computation in Combinatorial Optimization , 2004, Lecture Notes in Computer Science.

[19]  Juan A. Díaz,et al.  A compact model and tight bounds for a combined location-routing problem , 2005, Comput. Oper. Res..

[20]  Musara Mazanai,et al.  Impact of just-in-time (JIT) inventory system on efficiency, quality and flexibility among manufacturing sector, small and medium enterprise (SMEs) in South Africa , 2012 .

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

[22]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[23]  Thierry Kulcar,et al.  Optimizing solid waste collection in Brussels , 1996 .

[24]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

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

[26]  Nenad Mladenovic,et al.  Variable neighborhood search for location routing , 2013, Comput. Oper. Res..

[27]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[28]  S. Salhi,et al.  The many-to-many location-routing problem , 1998 .

[29]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

[31]  Ching-Jung Ting,et al.  A multiple ant colony optimization algorithm for the capacitated location routing problem , 2013 .

[32]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[33]  Anna Sciomachen,et al.  A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem , 2009, Comput. Oper. Res..

[34]  Roberto Baldacci,et al.  An Exact Method for the Capacitated Location-Routing Problem , 2011, Oper. Res..

[35]  Illia Racunica,et al.  OPTIMAL LOCATION OF INTERMODAL FREIGHT HUBS , 2005 .

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

[37]  Robert D. Klassen,et al.  Just-in-Time Manufacturing and Pollution Prevention Generate Mutual Benefits in the Furniture Industry , 2000, Interfaces.

[38]  Arno Bruns,et al.  Restructuring of Swiss parcel delivery services , 2000, OR Spectr..

[39]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[40]  Paolo Toth,et al.  A two-phase hybrid heuristic algorithm for the capacitated location-routing problem , 2013, Comput. Oper. Res..

[41]  Juan José Salazar González,et al.  The multi-commodity one-to-one pickup-and-delivery traveling salesman problem , 2009, Eur. J. Oper. Res..

[42]  M. Labbé,et al.  Polyhedral Properties of the Uncapacitated Multiple Allocation Hub Location Problem , 2000 .

[43]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..

[44]  W. Pierskalla,et al.  A Transportation Location-Allocation Model for Regional Blood Banking , 1979 .

[45]  Bassem Jarboui,et al.  Genetic algorithm with iterated local search for solving a location-routing problem , 2012, Expert Syst. Appl..

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

[47]  Ludo Gelders,et al.  Plant location and vehicle routing in the Malaysian rubber smallholder sector: A case study , 1989 .

[48]  Ted K. Ralphs,et al.  A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions , 2009 .

[49]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[50]  Benayad Nsiri,et al.  A Memetic Algorithm for the Capacitated Location-Routing Problem , 2016 .

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

[52]  Juan-José Salazar-González,et al.  The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: a matheuristic , 2011 .

[53]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .