改进PSO算法的物流配送路径规划方法
Logistics Distribution Path Planning Method Based on Improved PSO
张得龙 1张敏2
作者信息
- 1. 潍坊科技学院智能制造学院,山东潍坊 262700;东新大学计算机系,全南罗州58245
- 2. 山东管理学院信息工程学院,山东济南 250357
- 折叠
摘要
为降低物流配送过程中的能耗和碳排放量,对物流配送路径进行优化显得非常必要.针对传统PSO算法易陷入局部最优、过早收敛等问题,提出了一种基于改进PSO算法的物流配送路径规划方法,通过调整算法的权重系数和学习因子,避免算法误入局部最优极值,优化算法收敛.经仿真结果表明,改进PSO算法与传统PSO算法的路径规划方法相比,在配送地点数相等的条件下,改进PSO算法比传统PSO算法规划路径更短,相对综合成本更低,且改进PSO算法比传统PSO算法规划路径缩短14.18％.
Abstract
In order to reduce energy consumption and carbon emissions in the logistics distribution process,it is necessary to optimize the logistics distribution routes.Based on the traditional PSO,and addressing issues such as being prone to local optima and premature convergence,a logistics distribution planning method based on an improved PSO is proposed,addressing issues such as premature convergence.The proposed method improves the algorithm by adjusting the weight coefficients,preventing the algorithm from falling into local optima and enhancing convergence.Simulation results,compared with the path planning method of the traditional PSO,show that this method results in shorter paths.Under the same node count conditions,the relative comprehensive cost is lower,with the improved PSO shortening the path by 14.18％compared to the traditional PSO.
关键词
改进PSO算法/路径规划/参数调整/优化控制Key words
improved PSO algorthm/path planning/parameter adjustment/control optimization引用本文复制引用
出版年
2024
NETL
NSTL
万方数据