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

摘要： 针对一般网络上的多车场多配送中心的物流配送问题，借鉴Floyd算法，构建出了一种在有车辆载重量限制的条件下，使完成所有配送任务总费用最少的算法。该算法具有路径标记功能，可以指出车辆从车场出发，经过配送中心以及用户点，最后返回原车场的次序与路径走向。

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