高师理科学刊2023，Vol.43Issue(12)：22-26,5.DOI:10.3969/j.issn.1007-9831.2023.12.004
基于改进Floyd算法的物流运输路径规划
Logistics transportation path planning based on improved Floyd algorithm
摘要
Abstract
Logistics transportation path planning is difficult when there are many stations,and the traditional Floyd algorithm has a high time complexity for path planning.Considering that the traditional Floyd algorithm has high planning time complexity due to the large number of nodes,a Floyd algorithm combined with an improved K-means clustering algorithm is proposed.This algorithm divides the logistics area by improving the K-means clustering algorithm in the case of a large number of nodes,reduces the number of nodes required for planning consideration,thereby reduces the time complexity of the Floyd algorithm.The comparative experiments between traditional Floyd algorithm and improved algorithm is conduct in complex environments,simulation analysis results show that the improved algorithm can find a better path in less time.关键词
K-means聚类算法/Floyd算法/时间复杂度/物流运输路径规划Key words
K-means clustering algorithm/Floyd's algorithm/time complication/logistics transportation path planning分类
数学引用本文复制引用
来远为,杨录峰..基于改进Floyd算法的物流运输路径规划[J].高师理科学刊,2023,43(12):22-26,5.基金项目
北方民族大学创新训练项目(2022-XJ-SX-05) （2022-XJ-SX-05）
