紧急运输最小费用流问题算法  

Arithmetic of Minimal Cost Flow of Emergent Transportation

作　　者：吴晓东[1] 辛昕[1] 张瑞鹏[1] 

机构地区：[1]军事交通学院军事交通系,天津300161

出　　处：《军事交通学院学报》2013年第1期25-28,38,共5页Journal of Military Transportation University

摘　　要：紧急运输与平时运输最大的区别就是时间性要求，在追求经济性指标时必须首先满足时间要求。提出紧急运输“时间-容量约束的多品种最小费用流”问题模型，并设计流的增广算法求解，通过算例对算法进行了验证。The most important difference between emergency transport and normal transport is time constrained, The time index is more important than economic index for emergency transport. A problem model of ＂multi-kinds minimum cost flow of time-capacity constraint＂ was purposed, and flow augmented algorithm was designed and verified by arithmetic example.

关 键 词：紧急运输 时间约束 多品种 最小费用流 

分 类 号：U116[交通运输工程]