关键词: 配送, 最短路径, 多车场, 多配送中心, Floyd算法

Abstract: This paper discusses the multiple depot multi-logistics center problem on the general network. Using Floyd algorithm, it gives an algorithm of the minimum cost on condition that carrying capacity of the vehicles limited. This algorithm has a function of labeling the path, it can point out the sequence of the vehicles from the depot to distributions and users, at last return to the original depot.

Key words: distribution, shortest path, multiple depot, multi-logistics center, Floyd algorithm