Network Sharing Based Two-Tier Vehicle Routing Optimization of Urban Joint Distribution Under Online Shopping

The rapid development of online shopping offers new opportunities to the express delivery industry, but also brings enormous challenges due to its characteristics of multi-frequency and small-batch distribution. And the lack of cooperation among express companies in the urban distribution has resulted in uneconomical distribution. In the context of the sharing economy, this paper attempts to solve this problem by implementing joint distribution strategy with sharing the network resources. Based on the customer’s time window of receipt, a two-tier vehicle routing optimization model of urban joint distribution considering transfer stations’ sharing is established, and a hybrid heuristic algorithm has been designed accordingly. The results of a case study show significant optimization effect by comparing the independent distribution and joint distribution as well as robustness of the designed algorithm.

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

[2]  S. Verstrepen,et al.  Horizontal logistics collaboration: decreasing costs through flexibility and an adequate cost allocation strategy , 2014 .

[3]  Janet Dickinson,et al.  Logistics impacts of student online shopping – Evaluating delivery consolidation to halls of residence ☆ , 2017 .

[4]  Richard F. Hartl,et al.  The multi-objective generalized consistent vehicle routing problem , 2015, Eur. J. Oper. Res..

[5]  Yosi Agustina Hidayat,et al.  A simulated annealing heuristic for the hybrid vehicle routing problem , 2017, Appl. Soft Comput..

[6]  Ray Y. Zhong,et al.  E-commerce Logistics in Supply Chain Management: Practice Perspective , 2016 .

[7]  Wei Wang,et al.  A heterogeneous fleet two-echelon capacitated location-routing model for joint delivery arising in city logistics , 2018, Int. J. Prod. Res..

[8]  Christof Defryn,et al.  A fast two-level variable neighborhood search for the clustered vehicle routing problem , 2017, Comput. Oper. Res..

[9]  Guy Desaulniers,et al.  The discrete time window assignment vehicle routing problem , 2012, Eur. J. Oper. Res..

[10]  Kenneth Sörensen,et al.  Determining collaborative profits in coalitions formed by two partners with varying characteristics , 2016 .

[11]  Can Berk Kalayci,et al.  An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery , 2016, Expert Syst. Appl..

[12]  K. Smith‐Miles,et al.  Assessing partnership savings in horizontal cooperation by planning linked deliveries , 2014 .