一种基于Dijkstra的物流配送路径优化算法设计  

A Dijkstra-based optimization algorithm design for logistics distribution path

作　　者：先梦瑜[1] XIAN Mengyu(Xi’an Aeronautical Polytechnic Institute,Xi’an 710089,China)

机构地区：[1]西安航空职业技术学院,陕西西安710089

出　　处：《电子设计工程》2023年第2期20-24,共5页Electronic Design Engineering

基　　金：教育部部省共建项目(教职成司函[2020]34号)。

摘　　要：在物流配送过程中,物流配送路径的选择是决定快递时效的关键因素。针对传统Dijkstra算法在大规模数据求解过程中效率低、耗时长的问题,文中对其进行了深入的改进和优化。在算法运行过程中,通过使用多标号模型对遍历过程进行了优化。同时,在运算过程中采用并行求解的模式来提升模型处理速度。实验测试结果表明,文中设计的路径优化算法相比传统Dijkstra算法,大规模数据的求解时间缩减了50%以上,算法并行加速比在大规模数据求解时达到了1.75倍,证明了所提算法的并行求解效率较高,具有良好的工程应用价值。In the process of logistics distribution,the choice of logistics distribution path is the key factor to determine the timeliness of express delivery.Aiming at the problems of low efficiency and long time-consuming in the process of solving large-scale data,the traditional Dijkstra algorithm is deeply improved and optimized in this paper.In the running process of the algorithm,the traversal process is optimized by using the multi label model.At the same time,the parallel solution mode is used to improve the processing speed of the model.The experimental results show that the path optimization algorithm designed in this paper reduces the solution time of large-scale data by more than 50%compared with the traditional Dijkstra algorithm,and the parallel acceleration ratio of the algorithm reaches 1.75 times when solving large-scale data.It is proved that the parallel solution efficiency of the proposed algorithm is high and has good engineering application value.

关 键 词：最短路径求解 DIJKSTRA算法 多标号算法 并行求解 物流配送路径 图论 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]