| 基于加气站槽车调度的模型建立与算法研究 |
| |
| 引用本文： | 张明杰,陈汶滨. 基于加气站槽车调度的模型建立与算法研究[J]. 信息技术, 2011, 0(5): 119-121 |
| |
| 作者姓名： | 张明杰 陈汶滨 |
| |
| 作者单位： | 西南石油大学计算机学院,成都,610500 |
| |
| 摘 要： | 通过对CNG的发展形势介绍,深入到要研究的具体问题——槽车调度,槽车调度就是加气站母站向子站调度发送槽车。匈牙利算法是用到线性规划上解决最优化最优解的问题。考虑到槽车调度优化的问题的特殊性,因此在匈牙利算法的思想基础上,提出了最大差值法。此方法能更高效率地运算出最优解。
|
| 关 键 词： | 槽车调度 调度模型 匈牙利算法 算法改进 |
Study of algorithm and solution of the model about tankercar vehicles dispatch based on filling station |
| |
| ZHANG Ming-jie,CHEN Wen-bin. Study of algorithm and solution of the model about tankercar vehicles dispatch based on filling station[J]. Information Technology, 2011, 0(5): 119-121 |
| |
| Authors: | ZHANG Ming-jie CHEN Wen-bin |
| |
| Affiliation: | (School of Computer,Southwest Petroleum University,Chengdu 610500,China) |
| |
| Abstract: | This paper introduces the developments of CNG,and presents in-depth study of tankercar scheduling problem,specifically,which sends tankercars from mother-station to the sub-station scheduling.The Hungarian algorithm is used to solve linear programming optimization problem.It taked into account the special nature of the problem of tankercar scheduling optimization,based on the idea of the Hungarian algorithm,proposed the maximum deduction method.This method can be more efficient to calculate the optimal solution. |
| |
| Keywords: | tankercar scheduling scheduling model the Hungarian algorithm improved algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
