| 基于双最短时间的运输分配研究 |
| |
| 引用本文： | 石玉峰,彭其渊,门志强.基于双最短时间的运输分配研究[J].空军工程大学学报,2004,5(6):76-79. |
| |
| 作者姓名： | 石玉峰 彭其渊 门志强 |
| |
| 作者单位： | [1]西南交通大学交通运输学院，四川成都610031 [2]成都空军军交运输处，四川成都610041 |
| |
| 摘 要： | 以运输分配为研究对象，提出了先遣需求完成最短时限和总运输时间最短问题，并给出了问题的网络模型。运用图论知识，构造了基于网络最大流算法和最短时间流算法的计算步骤，算例表明，本算法可有效地解决运输问题。
|
| 关 键 词： | 运输分配 最短时间 多目标 |
| 文章编号： | 1009-3516(2004)06-0076-04 |
| 修稿时间： | 2004年5月19日 |
Research of Transportation Assignment Based on Double Shortest Time in War |
| |
| SHI Yu-feng,PENG Qi-yuan,MEN Zhi-qiang.Research of Transportation Assignment Based on Double Shortest Time in War[J].Journal of Air Force Engineering University(Natural Science Edition),2004,5(6):76-79. |
| |
| Authors: | SHI Yu-feng PENG Qi-yuan MEN Zhi-qiang |
| |
| Institution: | SHI Yu-feng~1,PENG Qi-yuan~1,MEN Zhi-qiang~2 |
| |
| Abstract: | By taking the problem of transportation assignment as an object for research, the shortest time limit of task sent in advance and the shortest total time of task are presented, at the same time a network model is built in this paper. Based on graph theory, the optimal algorithms are designed by the methods of maximum flow and the shortest time flow. Finally, the experimental calculation is presented. |
| |
| Keywords: | transportation assignment shortest time multi-objective |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《空军工程大学学报》浏览原始摘要信息 |
| 点击此处可从《空军工程大学学报》下载免费的PDF全文 |
