| 带时间约束的运输问题简便解法 |
| |
| 引用本文： | 贾春玉,胡若飞,洪琦. 带时间约束的运输问题简便解法[J]. 系统工程, 2004, 22(8): 14-16 |
| |
| 作者姓名： | 贾春玉 胡若飞 洪琦 |
| |
| 作者单位： | 1. 长春大学,管理学院,吉林,长春,130022
2. 深圳信息职业技术学院,基础部,广东,深圳,518029 |
| |
| 摘 要： | 带时间约束的运输问题的传统解法通常是用多目标规划法。多目标规划法虽可解运输问题，但比较繁琐，不便于掌握和实际应用与推广。为了克服这一缺欠，提出新的解法。简便解法利用简单的数学方法把多目标规划法简化为单一目标，简化为传统运输问题模型。此外在此基础上还给出快捷法求解运输问题．使得带时间约束的运输问题的求解更加简捷、更加便于掌握和实际应用与推广。
|
| 关 键 词： | 运输问题 指派问题 简便解法 |
| 文章编号： | 1001-4098(2004)08-0014-03 |
A Simple Method of Transportation Problems with Time Restraint |
| |
| JIA Chun-yu,HU Ruo-fei,HONG Qi. A Simple Method of Transportation Problems with Time Restraint[J]. Systems Engineering, 2004, 22(8): 14-16 |
| |
| Authors: | JIA Chun-yu HU Ruo-fei HONG Qi |
| |
| Affiliation: | JIA Chun-yu~1,HU Ruo-fei~1,HONG Qi~2 |
| |
| Abstract: | The traditional method for solving transportation problem with time restraint is a nonlinear multi-objective (program) method. It is not only complex but also hard to apply in practice .To overcome this defeat, a new method is (created.) The new method is changing a nonlinear multi-objective program to single problem with simple mathematics (method.) Beside this new method a quick algorithm is gived for solving transportation. The quick algorithm is not only more simple but also more easy to master and apply. |
| |
| Keywords: | Transportation Problems Assigning Problems Simple Method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
