摘要
针对一般网络上的单车型车辆配送问题,借鉴Floyd算法与节约路径法,构建出了一种在所用车辆数最少的条件下,使总配送里程最短的算法。该算法不但能反映出用车数量,而且同时可以指出配送中心到各用户点运送物资的次序与路径走向。
This paper discusses the single- type distribution problem on the general network in logistics.Using Floyd algorithm and saving method, it gives an algorithm of the route shortest on condition that the number of vehicles is the least,This algorithm not only reflects the number of vehicles but also gives the distribution order and route label of every user spot.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第18期215-217,共3页
Computer Engineering and Applications
关键词
配送
最短路径
叶点
单车型
节约算法
FLOYD算法
distribution, shortest path,leaf point, single - type, saving method, Floyd algorithm
