Abstract
The vehicle routing problem with split delivery—an important branch of the classic vehicle routing problem—relaxes the constraint that each customer is visited only once. The objective is to minimize the transportation distance and the vehicles used. A two-stage algorithm based on the improved sweep heuristic approach is proposed for this problem. Customer points are clustered into the minimum number of groups via multi-restart iterations. The load demands and the split point in each group are determined by the load rate and the fine-tuned threshold coefficients. An optimal route is generated by a Tabu search algorithm to minimize the travel distance in each group. Numerical experiments are conducted on benchmark datasets to verify the feasibility and effectiveness of the proposed algorithm. The computational results show the near-optimal performance of the proposed algorithm with regard to the transportation distance and the computation time to the instances with a scattered distribution geographical characteristic.
This work is sponsored by the National Natural Science Foundation of China (grant no. 61872077) and the Natural Science Fund of Jiangsu Province Education Commission (grant no. 17KJB520040).
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
Similar content being viewed by others
References
Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 2, 141–145.
Archettic, C., & Speranza, M. G. (2012). Vehicle routing problems with split deliveries. International Transactions in Operational Research, 19, 3–22.
Archettic, C., Hertz, A., & Speranza, M. G. (2006). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 1, 64–73.
Jin, M., Liu, K., & Bowden, R. O. (2007). A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. International Journal of Production Economics, 1, 228–242.
Liu, W., & Huang, J. (2011). Two-stage algorithm for split delivery vehicle routing problem. Journal of Jimei University (Natural Science), 1, 38–44.
Wilck, J. H., IV, & Cavalier, T. M. (2012). A construction heuristic for the split delivery vehicle routing problem. American Journal of Operations Research, 2, 153–162.
Wen, Z. Z. (2015) Researches on iterated local search for the split delivery vehicle routing problem. M.S. thesis, Beijing Transportation University, China.
Archettic, C., Bianchessi, N., & Speranza, M. G. (2011). A column generation approach for the split delivery vehicle routing problem. Networks, 58(4), 241–254.
Archetti, C., Bianchessi, N., & Speranza, M. G. (2015). A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Computer Operation Research., 64, 1–10.
Xiang, T. T., & Pan, D. Z. (2016). Clustering algorithm for split delivery vehicle routing problem. Journal of Computer Applications, 11, 3141–3145.
Shi, J. L., & Zhang, J. (2017). Model and algorithm for split delivery vehicle routing problem with stochastic customers. Kongzhi yu Juece/Control and Decision, 32(2), 213–222.
Han, Z., Yang, Y., Jiang, Y., Liu, W. & Wang, E. (2018). SDVRP-based reposition routing in bike-sharing system. In Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), LNCS (Vol. 11335, pp. 596–610).
Shi, J., Zhang, J., Wang, K., & Fang, X. (2018). Particle swarm optimization for split delivery vehicle routing problem. Asia-Pacific Journal of Operational Research, 35(2), 1840006.
Ozbaygin, G., Karasan, O., & Yaman, H. (2018). New exact solution approaches for the split delivery vehicle routing problem. EURO Journal on Computational Optimization, 6(1), 85–115.
Gillet, B. E., & Miller, L. R. (1974). A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22(2), 340–349.
Min, J. N., Jin, C., & Lu, L. J. (2018) A three-stage approach for split delivery vehicle routing problem solving. In Proceedings of 8th International Conference on Logistics, Informatics and Service Sciences (LISS), Toronto University, Toronto, Canada & Beijing Jiaotong University, Beijing, China (pp. 96–101). IEEE Catalog Number: CFP18LIS-CDR.
VRP Web. http://www.bernabe.dorronsoro.es/vrp/.
Min, J. N., Jin, C., & Lu, L. J. (2019). Maximum-minimum distance clustering method for split delivery vehicle routing problem: Case studies and performance comparisons. Advances in Production Engineering & Management, 14(1), 125–135.
Acknowledgement
The authors wish to express the gratitude to the Humanities and Social Sciences Research Base Fund of Jiangsu Province Education Commission (grant no. 2017ZSJD020) and the Jiangsu Key Construction Laboratory of IoT Application Technology, Taihu University of Wuxi for their financial support to this work.
The authors also would like to thank the reviewers and editors, who have carefully reviewed the manuscript and provided pertinent and useful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Min, J., Jin, C., Lu, L. (2020). Improved Sweep Algorithm-Based Approach for Vehicle Routing Problems with Split Delivery. In: Zhang, J., Dresner, M., Zhang, R., Hua, G., Shang, X. (eds) LISS2019. Springer, Singapore. https://doi.org/10.1007/978-981-15-5682-1_9
Download citation
DOI: https://doi.org/10.1007/978-981-15-5682-1_9
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-5681-4
Online ISBN: 978-981-15-5682-1
eBook Packages: Business and ManagementBusiness and Management (R0)