Application of Hierarchical Facility Location-Routing Problem with Optimization of an Underground Logistic System: A Case Study in China

Facility location problem (FLP) and vehicle routing problem (VRP) are two of the most challenging issues in logistics. This paper presents an exploration of the multinode facility location-routing problem with realistic conditions. The disposal centers, transfer stations, connected collection sites, and unconnected collection sites are built into a new hierarchical model which is solved by Generate Algorithm (GA). Model costs include node construction cost, pipeline construction cost, transport cost, and transfer cost. This paper considers that the transportation is a bidirectional flow not a single flow; each pairs node in the area needs transportation; the dynamic routing selection method is used to determine the routes of unconnected collection sites. FLP and VRP can be both solved in this model. To illustrate the applicability of the model, a case study is presented and the results are discussed. The model in this paper can reduce the cost of the traditional underground logistics system by 6%~8% in experiments.

[1]  Mingyong Lai,et al.  A metaheuristic method for vehicle routing problem based on improved ant colony optimization and Tabu search , 2012 .

[2]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[3]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

[4]  Junshan Zhang,et al.  Location-aided routing with uncertainty in mobile ad hoc networks: A stochastic semidefinite programming approach , 2011, Math. Comput. Model..

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

[6]  Surya B. Yadav,et al.  The Development and Evaluation of an Improved Genetic Algorithm Based on Migration and Artificial Selection , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[7]  Maria E. Mayorga,et al.  Joint location and dispatching decisions for Emergency Medical Services , 2013, Comput. Ind. Eng..

[8]  Yupo Chan,et al.  A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands , 2001, Comput. Oper. Res..

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

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

[11]  Kaj Holmberg,et al.  Exact solution methods for uncapacitated location problems with convex transportation costs , 1999, Eur. J. Oper. Res..

[12]  G. Laporte,et al.  An exact algorithm for minimizing routing and operating costs in depot location , 1981 .

[13]  Jiujun Cheng,et al.  Ant colony optimization with clustering for solving the dynamic location routing problem , 2016, Appl. Math. Comput..

[14]  Maria Paola Scaparra,et al.  A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem , 2017, Eur. J. Oper. Res..

[15]  Jian Wang,et al.  An Improved Particle Swarm Optimization Algorithm , 2011 .

[16]  Russell D. Meller,et al.  The interaction of location and inventory in designing distribution systems , 2000 .

[17]  Yannis Marinakis,et al.  improved particle swarm optimization algorithm for the apacitated location routing problem and for the location routing roblem with stochastic demands , 2015 .

[18]  C. H. Aikens,et al.  Facility location models for distribution planning , 1985 .

[19]  Mingzhe Li,et al.  A location-routing model for prepositioning and distributing emergency supplies , 2016 .

[20]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Dachuan Xu,et al.  Approximation Algorithms for the Robust Facility Location Problem with Penalties , 2015 .

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