Modeling for Logistics Distribution Route Optimization
DOI:
https://doi.org/10.63313/Management.8012Keywords:
Logistics and Distribution, Path Optimization, Ant Colony Algorithm, Pheromone Volatilization Coefficient, Heuristic informationAbstract
With the rapid development of e-commerce, logistics distribution, as a crucial link in the supply chain, directly impacts enterprise costs and customer satisfaction. This paper focuses on the problem of optimizing logistics distribution routes, aiming to reduce transportation costs and shorten delivery times. A mathematical model is established for this purpose. An improved ant colony algorithm is introduced to solve the model. Through strategies such as adaptively adjusting the pheromone evaporation coefficient and introducing heuristic information to optimize the transition probability, the search ability of the algorithm is enhanced. Simulation experiments are carried out using the data from actual logistics distribution cases, and a comparative analysis with traditional algorithms is conducted to verify the superiority of the improved ant colony algorithm in solving the problem of optimizing logistics distribution routes, thus providing effective methodological support for logistics enterprises to improve their operational efficiency.
References
[1] 杨璇璇. JY 集团钢材业务流程优化研究 [D]. 石家庄：河北地质大学，2024.
[2] Pradhananga R, Taniguchi E, Yamada T, et al. Bi-objective decision
[3] support system for routing and scheduling of hazardous materials [J].
[4] Socio-Economic Planning Sciences, 2023, 48 (2): 135-148.
[5] 吴桦。物流配送路线优化算法研究 [D]. 武汉：武汉邮电科学研究院，2024.
[6] 拓万聪。基于蚁群算法的带时间窗的易腐农产品冷链物流路径优化 [D]. 兰州：兰州交通大学，2023.
[7] 邢志娟。多目标优化问题的蚁群算法研究 [D]. 武汉：中国地质大学 (北京), 2010.
[8] G P, L M. Vehicle routing and the value of postponement [J]. The Journal of the Operational Research Society, 2013, 64 (9): 1429-1440.
[9] Stutzle T, Hoos H. Max-Min ant system [J]. Future Generation Computer Systems, 2024, 16 (9): 889-891.
[10] 牛群，刘军。求解带时间窗车辆路径问题的改进型烟花算法 [J]. 只机械制造与自动化，2020, 49 (01): 158-161.
[11] 隆忠华。蚁群算法在 TSP 中的应用研究 [D]. 西安：长安大学，2009.
[12] Marinakis Y, Marinaki M, Migdalas A. A multi-adaptive particle swarm optimization for the vehicle routing problem with time windows [J]. Information Sciences, 2019, 481: 311-329.
[13] 张守京，段娇，童傅娇。考虑工位服务满意度的物料配送路径优化研究 [J]. 制造业自动化，2022, 44 (08): 27-33.
[14] Ahmed Z H, Maleki F, Yousefikhoshbakht M, et al. Solving the vehicle routing problem with time windows using modified football game algorithm [J]. Egyptian Informatics Journal, 2023, 24 (4): 100403.
[15] 黄新林，张隆飛，唐小伟。基于改进遗传算法的家电回收车辆路径规划方法 [J]. 同济大学学报 (自然科学版), 2024, 52 (01) 27-34.
[16] 李委委。混合蚁群算法在车辆路径优化问题中的研究与应用 [D]. 大连：大连交通大学，2013.
[17] 吴建辉，章兢，刘朝华。基于蚁群算法和免疫算法融合的 TSP 问题求解 [J]. 湖南大学学报 (自然科学版), 2024, 36 (10): 81-87.
[18] 谢传聪。粒子群优化算法在车辆路径问题中的应用研究 [D]. 成都：电子科技大学，2024.
[19] 代西红。医药冷链物流配送路径优化问题研究 [D]. 郑州：中原工学院，2023.
[20] Rababaah A R. Image-based extension to ant colony algorithm for path finding in gird-based environments [J]. International Journal of System Assurance Engineering and Management, 2024: 1-15.
[21] 甘宝，薛玉玺，魏文萍。基于改进遗传算法的车辆路径问题 [J]. 交通运输研究，2024, 1 (04): 88-94.
[22] 刘斌。考虑碳排放的多配送中心车辆精品文档收集整理汇总车辆路径问题研究 [D]. 大连：大连交通大学，2023.
[23] Gokalp O, Ugur A. A multi-start ILS–RVND algorithm with adaptive solution acceptance for the CVRP [J]. Soft Computing, 2024, 24 (4): 2941-2953.
[24] Lai M Y, Liu C S, Tong X J. A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows [J].
[25] Journal of Industrial & Management Optimization, 2024, 6 (2): 435-451.Dantzig G B, Ramser J H. The truck dispatching problem [J]. Management science, 1924, 6 (1): 80-91.
[26] Alhenawi E, Khurma R A, Sharieh A A, et al. Parallel ant colony optimization algorithm for finding the shortest path for mountain climbing [J]. IEEE Access, 2023, 11: 6185-6196.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 by author(s) and Erytis Publishing Limited.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
How to Cite
