基于Dijsktra-PSO算法求解城市配送路线优化问题研究  

Research on Urban Delivery Path Optimization Problem Based on Dijsktra-PSO Algorithm

作　　者：孙红冉[1] 施彦[1] SUN Hongran;SHI Yan(Jiangsu Vocational College of Business,Nantong 226011,China)

机构地区：[1]江苏商贸职业学院,江苏南通226011

出　　处：《现代信息科技》2024年第8期156-160,166,共6页Modern Information Technology

基　　金：江苏省高等教育教改研究立项课题项目(2019JSJG367);江苏高校“青蓝工程”。

摘　　要：对城市配送路线的设计进行了研究,在复杂的城市道路选择上,首先采用Dijsktra算法求解单源最短可行性路径,从而得到配送中心到客户以及客户到客户之间的物流配送网络;其次运用粒子群算法的自适应性和鲁棒性,设计出城市配送路线优化方案;最后将优化后的配送效果与原来的配送计划进行对比分析,发现优化后的路径更短,效果更优,可为解决城市配送问题提供实际参考。A study is conducted on the design of urban delivery paths.In the selection of complex urban roads,the Dijsktra algorithm is first used to solve the shortest feasible path of a single source,thereby obtaining the logistics delivery network from the delivery center to customers and from customers to customers.Secondly,it designs an optimization plan for urban delivery paths using the adaptability and robustness of particle swarm optimization.Finally,the optimized delivery effect is compared with that of the original delivery plan,and it is found that the optimized path is shorter and the effect is better,which can provide practical reference for solving urban delivery problems.

关 键 词：路径优化 Dijsktra算法 粒子群算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] F252[自动化与计算机技术—控制科学与工程]