摘要
通过把转运问题描述成一般网络上的运输问题,给出了直接求解转运问题的新算法,与先将转运问题转化成经典运输问题,然后再按经典运输问题求解的算法相比,这种算法简便适用。
In this paper, a new algorithm that directly solves the transshipment problem is given by describing the transshipment problem as the transportation problem on the general network. The algorithm is more convenient and utility than the old one.
出处
《系统工程理论方法应用》
北大核心
2005年第1期92-96,共5页
Systems Engineering Theory·Methodology·Applications
关键词
运输问题
转运问题
网络
最短路径
最小费用
FLOYD算法
transportation problem
transshipment problem
network
shortest path
smallest cost
Floyd algorithm
