Abstract
Aiming at the vehicle path optimization problem of multi-center recyclables under the background of low carbon, a mathematical model with the goal of minimizing the total cost taking into account the carbon emission cost is constructed, and a two-stage algorithm is designed to solve it according to the characteristics of the model. In the first stage, the k-means clustering algorithm is used to cluster the recycling points based on the principle of minimum distance, and then each type is divided into the nearest recycling center according to the distance between the clustering center and the recycling center. In the second stage, adaptive genetic algorithm is designed to solve the vehicle recycling path of each recycling center, and the optimal recycling path of each recycling center is summarized to obtain the overall recycling plan. Finally, a numerical example is given to prove the effectiveness of the proposed model and algorithm in solving the multi-center vehicle recovery path problem.
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
Cao S, Liao W, Huang Y (2021) Heterogeneous fleet recyclables collection routing optimization in a two-echelon collaborative reverse logistics network from circular economic and environmental perspective. Sci Total Environ 758:144062
Dantzig BG, Ramser HJ (1959) The truck dispatching problem. Manage Sci 6(1)
Liu Y, Xu S, Zhang Y et al (2016) Research on the path problem of recycling vehicles under consideration of path feasibility and warehouse collection mode. China Manage Sci 24(12):98–107
Pan W, Guo H, Du T et al (2018) Research on oil casing recovery vehicle path problem and solution algorithm based on clearing small habitat differential evolution. China Manage Sci 26(5):118–128
Pu S, **a C (2018) Robust optimization model for urban medical waste recycling path. Syst Eng 36(06):117–123
Wang Y, Meng Y, Luo S et al (2023) Research on vehicle routing problem in reverse logistics under intelligent recycling model. Comput Integr Manuf Sys 1–28
Hu R, Chen W, Qian B et al (2021) Learning more than ant colony algorithm to solve the green yard vehicle routing problem. J System Simul 9:2095–2108
Calvet L, Wang D, Juan A et al (2019) Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands. Int Trans Oper Res 26(2)
Lu J, Zhai W, Li J et al (2021) Multi-constraint vehicle path optimization based on improved hybrid leapfrog algorithm. J Zhejiang Univ (EngTechnol) 55(2):259–270Â
Wang Y, Luo S, Zhou X et al (2019) Vehicle routing optimization with multi-center co-distribution open-close hybrid. J Syst Manage 32(2):215–232
Li T, Deng S, Lu C et al (2023) A method of low-carbon garbage collection and transportation path optimization based on improved ant colony algorithm. J Highw Transp Sci Technol 40(5):221–227+246
Yang S, Liu X, Li K (2022) Improvement and implementation of adaptive genetic algorithm. Comput Digital Eng 50(8):1647–1651
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Liu, J., Jia, K. (2024). Research on Multi-Center Vehicle Recovery Routing Optimization. In: Li, X., Xu, X. (eds) Proceedings of the Eleventh International Forum on Decision Sciences. ITLBD&DS 2023. Uncertainty and Operations Research. Springer, Singapore. https://doi.org/10.1007/978-981-99-9963-7_14
Download citation
DOI: https://doi.org/10.1007/978-981-99-9963-7_14
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-9962-0
Online ISBN: 978-981-99-9963-7
eBook Packages: Business and ManagementBusiness and Management (R0)