Design of a two-echelon freight distribution system in an urban area considering third-party logistics and loading-unloading zones

Abstract This research examines the problem of designing a two-echelon freight distribution system in a dense urban area that considers third-party logistics (TPL) and loading–unloading zones (LUZs). The proposed system takes advantage of outsourcing the last mile deliveries to a TPL provider and utilizing LUZs as temporary intermediate facilities instead of using permanent intermediate facilities to consolidate freight. A mathematical model and a simulated annealing (SA) algorithm are developed to solve the problem. The efficiency and effectiveness of the proposed SA heuristic are verified by testing it on existing benchmark instances. Computational results show that the performance of the proposed SA is comparable with that of another state-of-the-art algorithm. The model and algorithm are then used to design a two-echelon freight distribution system in Taipei City, Taiwan. Results of the case study indicate that the proposed model and algorithm provide a better distribution system.

[1]  Thiago Alves de Queiroz,et al.  Two effective simulated annealing algorithms for the Location-Routing Problem , 2018, Appl. Soft Comput..

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

[3]  Shih-Wei Lin,et al.  A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows , 2015, Appl. Soft Comput..

[4]  Ehsan Nikbakhsh,et al.  A HEURISTIC ALGORITHM AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM WITH SOFT TIME WINDOW CONSTRAINTS , 2010 .

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

[6]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

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

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

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

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

[11]  E. H. Grosse,et al.  A simulated annealing approach for the joint order batching and order picker routing problem with weight restrictions , 2014 .

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

[13]  Xiaohang Yue,et al.  The two echelon open location routing problem: Mathematical model and hybrid heuristic , 2018, Comput. Ind. Eng..

[14]  Justin C. Goodson,et al.  A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands , 2015, Eur. J. Oper. Res..

[15]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

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

[17]  Yiyo Kuo,et al.  Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem , 2010, Comput. Ind. Eng..

[18]  Klaus Hinkelmann,et al.  Design and Analysis of Experiment , 1975 .

[19]  J. R. Shin,et al.  An efficient simulated annealing algorithm for network reconfiguration in large-scale distribution systems , 2002 .

[20]  Vaidyanathan Jayaraman,et al.  Production , Manufacturing and Logistics A simulated annealing methodology to distribution network design and management , 2002 .

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

[22]  Ammar Oulamara,et al.  A Local Search approach for the Two–Echelon Multi-products Location–Routing problem with Pickup and Delivery , 2015 .

[23]  Ruggero Golini,et al.  Loading/unloading lay-by areas location and sizing: a mixed analytic-Monte Carlo simulation approach , 2016 .

[24]  Hong-Chan Chang,et al.  Network reconfiguration in distribution systems using simulated annealing , 1994 .

[25]  André Romano Alho,et al.  Utilizing urban form characteristics in urban logistics analysis: a case study in Lisbon, Portugal , 2015 .

[26]  Kannan Govindan,et al.  Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food , 2014 .

[27]  Alex Van Breedam,et al.  Improvement heuristics for the Vehicle Routing Problem based on simulated annealing , 1995 .

[28]  Jesús Muñuzuri,et al.  Improving the design of urban loading zone systems , 2017 .

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

[30]  Philip M. Kaminsky,et al.  Designing and managing the supply chain : concepts, strategies, and case studies , 2007 .

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

[32]  Shuo-Yan Chou,et al.  Solving the truck and trailer routing problem based on a simulated annealing heuristic , 2009, Comput. Oper. Res..

[33]  R. H. Myers,et al.  STAT 319 : Probability & Statistics for Engineers & Scientists Term 152 ( 1 ) Final Exam Wednesday 11 / 05 / 2016 8 : 00 – 10 : 30 AM , 2016 .

[34]  Shuo-Yan Chou,et al.  The museum visitor routing problem , 2010, Appl. Math. Comput..

[35]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

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

[37]  Mathieu Gardrat,et al.  Modeling Delivery Spaces Schemes: Is the Space Properly used in Cities Regarding Delivery Practices? , 2016 .

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

[39]  Thibaut Vidal,et al.  A large neighbourhood based heuristic for two-echelon routing problems , 2015, Comput. Oper. Res..

[40]  Wen-Chyuan Chiang,et al.  Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..

[41]  Vahid Majazi Dalfard,et al.  Two meta-heuristic algorithms for two-echelon location-routing problem with vehicle fleet capacity and maximum route length constraints , 2012, Neural Computing and Applications.