摘要
考虑一类带容量限制的运输问题.采用构造辅助网络的方法,将运输网络中的每个配送中心均拆分成两个节点,构造出新弧,形成新的网络,把此类运输问题转换为最小费用流问题来解决.并在此基础上,考虑运输网络中配送中心的容量扩张问题.
A type of transportation problem with capacity-limitation is considered. By using the auxiliary network, every distribution center in the transportation network is split into two nodes, and new arcs are then created in the new network. Thus, such kind of transportation problem is turned into the minimum cost flow problem, based on which the capacity expansion problem of the distribution center in the transportation network is also considered.
出处
《海军工程大学学报》
CAS
2004年第5期96-99,共4页
Journal of Naval University of Engineering
基金
网络工作站选址的两级优化模型研究项目(70271027)
关键词
运输问题
容量限制
容量扩张
最小费用流
transportation problem
capacity limitation
capacity expansion
minimum cost flow
