Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Yu, Y., et al.: E-commerce logistics in supply chain management: practice perspective. Procedia CIRP 52, 179–185 (2016)
Cherrett, T., et al.: Logistics impacts of student online shopping – evaluating delivery consolidation to halls of residence. Transp. Res. Part C Emerg. Technol. 78, 111–128 (2017)
Adenso-DĂaz, B., et al.: Assessing partnership savings in horizontal cooperation by planning linked deliveries. Transp. Res. Part A Policy Pract. 66, 268–279 (2014)
Palhazi Cuervo, D., Vanovermeire, C., Sörensen, K.: Determining collaborative profits in coalitions formed by two partners with varying characteristics. Transp. Res. Part C Emerg. Technol. 70, 171–184 (2016)
Vanovermeire, C., et al.: Horizontal logistics collaboration: decreasing costs through flexibility and an adequate cost allocation strategy. Int. J. Logistics Res. Appl. 17(4), 339–355 (2014)
Kovacs, A.A., Parragh, S.N., Hartl, R.F.: The multi-objective generalized consistent vehicle routing problem. Eur. J. Oper. Res. 247(2), 441–458 (2015)
Spliet, R., Desaulniers, G.: The discrete time window assignment vehicle routing problem. Eur. J. Oper. Res. 244(2), 379–391 (2015)
Zhao, Q., Wang, W., De Souza, R.: A heterogeneous fleet two-echelon capacitated location-routing model for joint delivery arising in city logistics. Int. J. Prod. Res. 2, 1–19 (2017)
Defryn, C., Sörensen, K.: A fast two-level variable neighborhood search for the clustered vehicle routing problem. Comput. Oper. Res. 83, 78–94 (2017)
Yu, V.F., et al.: A simulated annealing heuristic for the hybrid vehicle routing problem. Appl. Soft Comput. 53, 119–132 (2017)
Kalayci, C.B., Kaya, C.: An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst. Appl. 66, 163–175 (2016)
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)
Acknowledgement
This study was supported by the Fundamental Research Funds for the Central Universities Project (under Grant No. 106112017CDJXSYY001 and 106112015CDJSK02JD05). We also appreciate the editor and the anonymous reviewers for their manuscript processing and remarkable comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Li, L., Wang, X., Lin, Y., Liu, K., Tang, Y. (2018). Network Sharing Based Two-Tier Vehicle Routing Optimization of Urban Joint Distribution Under Online Shopping. In: Wang, S., Price, M., Lim, M., Jin, Y., Luo, Y., Chen, R. (eds) Recent Advances in Intelligent Manufacturing . ICSEE IMIOT 2018 2018. Communications in Computer and Information Science, vol 923. Springer, Singapore. https://doi.org/10.1007/978-981-13-2396-6_12
Download citation
DOI: https://doi.org/10.1007/978-981-13-2396-6_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2395-9
Online ISBN: 978-981-13-2396-6
eBook Packages: Computer ScienceComputer Science (R0)