摘要
配送是物流中的核心环节,最短路径的选择决定着配送效率.从图论的角度出发,分析了经典的D ijkstar算法和F loyd算法,并指出了它们的一些不足:D ijkstar算法随着配送点数目的增多,效率将下降;F loyd算法主要解决有向图等.给出了一些改进的建议:针对D ijkstar算法,将交通路线图分成子图,以提高效率;对于F loyd算法,将邻接矩阵上三角和下三角复制,能解决采用F loyd算法解决无向图的最短路径问题.针对某物流配送公司,给出了基于改动后的F loyd算法的程序实现,开发了一个配送路径优化决策系统.
Since the delivery is the key point of logistics,shortest path decision is essential for the efficiency of delivery. Classical Dijkstar algorithm and Floyd algorithm are analyzed from the point of view of Graph Theory. It points out these two algorithms deficiencies such as： Dijkstar algorithm efficiency will drop fast with the number of delivery point increasing, Floyd algorithm mainly solves the direction graph problem and not fit for non-direction graph problem. Then some improvement methods are brought forward such as： for Dijkstar algorithm,the whole graph ~s divided into some child graph and then it will increase the efficiency, for Floyd algorithm,the abut matrix is modified to an equal matrix and then it solves non-direction graph problem based on Floyd algorithm. Finally,an example of logistics delivery route optimization based on Floyd algorithm is given.
出处
《武汉理工大学学报（交通科学与工程版）》
2005年第5期797-800,共4页
Journal of Wuhan University of Technology（Transportation Science & Engineering）
