Low-carbon Distribution Path Optimization of Urban Fresh Logistics Based on Improved Ant Colony Algorithm
DOI:
https://doi.org/10.54097/3asvdf81Keywords:
Urban Fresh Logistics, Low-carbon Distribution, Improved Ant Colony Algorithm, Multi-objective OptimizationAbstract
With the rapid expansion of fresh food e-commerce and urban instant retail, urban fresh logistics has become a core component of modern urban circulation system. Different from general commodity logistics, fresh cold chain distribution has strict requirements on delivery time, transportation temperature and service quality, which also brings problems such as repeated vehicle routes, high energy consumption and excessive carbon emissions in actual operation. Traditional fresh logistics path optimization mostly takes the shortest distance or the lowest transportation cost as the single optimization goal, ignoring the low-carbon development requirements under the dual-carbon policy, and the classic optimization algorithm is prone to local optimal solutions and slow convergence speed in complex urban traffic scenarios, resulting in poor practicability of optimization results. Aiming at the above pain points, this paper constructs a multi-objective optimization model of urban fresh logistics low-carbon distribution, which takes total distribution cost and total carbon emission as dual optimization objectives, and sets multi-dimensional constraints including vehicle load limit, customer time window and driving speed limitation. On this basis, an improved ant colony algorithm is proposed by optimizing the pheromone update mechanism and heuristic function weight, which effectively makes up for the defects of the traditional ant colony algorithm. Finally, simulation example analysis is carried out with urban fresh distribution scene data. The results show that compared with the traditional algorithm optimization scheme, the improved algorithm can reduce the total distribution cost by 8.2% and the total carbon emission by 11.5%, and significantly improve the convergence efficiency and path rationality. This research realizes the coordinated optimization of economic benefit and environmental benefit of fresh logistics distribution, and can provide effective theoretical support and practical reference for the intelligent and low-carbon transformation of urban fresh logistics enterprises.
Downloads
References
[1] Qin, G., Tao, F., & Li, L. (2019). A vehicle routing optimization problem for cold chain logistics considering customer satisfaction and carbon emissions. International Journal of Environmental Research and Public Health, 16(4), 576. https://doi.org/10.3390/ijerph16040576
[2] Zulvia, F. E., Kuo, R. J., & Nugroho, D. Y. (2020). A many-objective gradient evolution algorithm for solving a green vehicle routing problem with time windows. Computers & Industrial Engineering, 142, 106356. https://doi.org/10.1016/j.cie.2020.106356
[3] Fang, W. T., Ai, K., Wang, Q., & Liu, Y. (2019). Optimization of cold chain logistics distribution route based on hybrid ant colony algorithm. Chinese Journal of Management Science, 27(11), 107–115. https://doi.org/10.16381/j.cnki.issn1003-207x.2019.11.011
[4] Ning, T., Gou, T., & Liu, X. D. (2022). Simulation research on cold chain logistics strategy of fresh agricultural products considering low-carbon constraints. Journal of System Simulation, 34(4), 762–770. https://doi.org/10.16182/j.issn1004731x.joss.21-0162
[5] Liu, S. Y., Chen, T. E., Chen, D., & Zhang, H. (2021). Optimization of fresh agricultural product distribution routes under time-varying and multi-vehicle conditions. Smart Agriculture, 3(3), 112–121.
[6] Dorigo, M., & Stützle, T. (2019). Ant colony optimization: Overview and recent advances. In Handbook of Metaheuristics (pp. 311–351). Springer. https://doi.org/10.1007/978-3-319-91086-4_10
[7] Wang, Y., & Li, J. (2023). Low-carbon vehicle routing optimization for urban fresh cold chain logistics with improved ant colony algorithm. Logistics Technology, 42(5), 62–68.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







