不可分流网络的最小费用流问题Minimum cost flow problem in indecomposable flow network
曹卫锋,梅霞,张兴永
摘要(Abstract)：
通常情况下单位流量费用最小的那条路径发送各个流总费用是最小的,但是往往单位流量费用最小的那条路径并不一定能满足所有流均可通过。针对不可分流的网络流最小费用问题,提出按流值排序寻求最优解的算法,并给出相关的理论证明及算法,最后通过具体实验测试了该算法的有效性。此算法可以快速求解所提的问题,并能够算出最优值。实例结果表明,该算法有效地解决了不可分流的网络流最小费用问题,可以应用于实际的网络优化中。
关键词(KeyWords)： 节点;最小费用流;不可分流;弧上限;最小费用路径;流值排序
基金项目(Foundation):
作者(Author): 曹卫锋,梅霞,张兴永
DOI: 10.16652/j.issn.1004-373x.2018.01.022
参考文献(References)：
- [1]黄凯,张晓旭,张晓濛,等.基于整数线性规划的MPSo C通信优化策略[J].上海交通大学学报,2015,49(2):184-190.HUANG Kai,ZHANG Xiaoxu,ZHANG Xiaomeng,et al.MPSo C communication optimization strategy based on integer linear programming[J].Journal of Shanghai Jiaotong University,2015,49(2):184-190.
- [2]吴超,黄淋妃.安全运筹学的学科构建研究[J].中国安全科学学报,2017(6):37-42.WU Chao,HUANG Linfei.Discipline construction of safety operations research[J].China safety science journal,2017(6):37-42.
- [3]CAI X,SHA D,WONG C K.Time-varying minimum cost flow problems[J].European journal of operational research,2001,131(2):352-374.
- [4]王勤波,许成,段伟伟,等.动态最小费用流问题[J].青岛大学学报(自然科学版),2008,21(4):39-41.WANG Qinbo,XU Cheng,DUAN Weiwei,et al.Dynamic minimum cost flow problems[J].Journal of Qingdao University(natural science edition),2008,21(4):39-41.
- [5]谢政,汤泽滢.带模糊约束的最小费用流问题[J].模糊系统与数学,1999,13(2):90-94.XIE Zheng,TANG Zeying.The minimum-cost flow problem with fuzzy constraint[J].Fuzzy systems and mathematics,1999,13(2):90-94.
- [6]董振宁.无容量限制的最小费用流问题[J].数学研究与评论,2004,24(4):751-757.DONG Zhenning.Uncapacitated minimum cost flow problem[J].Journal of mathematical research and exposition,2004,24(4):751-757.
- [7]CALVETE H I.Network simplex algorithm for the general equal flow problem[J].European journal of operational research,2003,150(3):585-600.
- [8]吴相林,尹峥.应用最小费用流求解活动网络时间-费用模型[J].华中科技大学学报(自然科学版),2007,35(1):42-45.WU Xianglin,YIN Zheng.Solving time-cost trade-off model for activity network by minimum cost flow principle[J].Journal of Huazhong University of Science and Technology(nature science edition),2007,35(1):42-45.
- [9]董振宁,张毕西.遗传算法求解带容量限制的最小费用流问题[J].数学的实践与认识,2007,37(2):30-36.DONG Zhenning,ZHANG Bixi.Study on capacitated minimum cost flow problem with genetic algorithm[J].Mathematics in practice and theory,2007,37(2):30-36.
- [10]张煜,吴露,田维.动态最小费用流启发式算法求解多式联运问题[J].武汉理工大学学报,2016,38(2):103-110.ZHANG Yu,WU Lu,TIAN Wei.Dynamic minimum cost flow-based heuristics solving problem of multimodal transport[J].Journal of Wuhan University of Technology,2016,38(2):103-110.