| 带时间限制的最小费用运输问题的网络流解法 |
| |
| 引用本文： | 马圆圆,栗娜,徐清云,李珍萍. 带时间限制的最小费用运输问题的网络流解法[J]. 物流技术, 2010, 0(21) |
| |
| 作者姓名： | 马圆圆 栗娜 徐清云 李珍萍 |
| |
| 作者单位： | 北京物资学院研究生部;北京物资学院信息学院; |
| |
| 基金项目： | 北京市自然科学基金项目(1092011); 北京市教委人文社科面上项目(SM200910037005); 北京市属市管高等学校人才强教计划项目(PHR201006217); 北京市教育委员会科研基地建设项目(WYJD200902) |
| |
| 摘 要： | 研究了带时间限制的最小费用运输问题,在分析了运量与运输时间关系的基础上,把运输时间划分成与运量无关和与运量有关的两部分;进一步根据已知的运输时间与运量的函数关系,把带时间限制的最小费用运输问题转化为最小费用最大流问题,给出了求解该问题的方法,并通过实例进行了计算。
|
| 关 键 词： | 带时间限制 运输问题 最小费用 网络流 |
Network Flow Approach to Minimum Cost Transport Problem with Time Constraint |
| |
| MA Yuan-yuan,LI Na,XU Qing-yun,LI Zhen-ping. Network Flow Approach to Minimum Cost Transport Problem with Time Constraint[J]. Logistics Technology, 2010, 0(21) |
| |
| Authors: | MA Yuan-yuan LI Na XU Qing-yun LI Zhen-ping |
| |
| Affiliation: | MA Yuan-yuan1,LI Na1,XU Qing-yun1,LI Zhen-ping2(1.Postgraduate Department,Beijing Wuzi University,Beijing 101149,2.School of Information,China) |
| |
| Abstract: | The paper studies the minimum cost transport problem with time constraint,and,after analyzing the relationship between volume and time of transport,dichotomizes transport time into volume-related and volume-unrelated parts.Then in accord with known equational relationship between time and volume of transport,it converts the minimum cost transport problem with time constraint into a minimum cost maximum flow problem and presents the approach for its solution which is verified in an empirical study. |
| |
| Keywords: | time constraint transport problem minimum cost network flownet of Things |
| 本文献已被 CNKI 等数据库收录！ |
|
