煤矿铁路最优空车分配方案的数学模型及算法 |
| |
引用本文: | 孙焰. 煤矿铁路最优空车分配方案的数学模型及算法[J]. 上海交通大学学报, 2000, 0(Z1) |
| |
作者姓名: | 孙焰 |
| |
摘 要: | 运用计算机编制矿区的最优空车分配方案 ,使全矿的总落地煤最少 .建立了数学定义和数学模型 ,给出空车分配问题的一系列最优性准则及化简方法 ,有效地降低了求解该问题的规模 .应用动态规划方法编制了求解该问题最优解的计算机算法 ,分析了该算法的复杂性和有效性 .通过对一个实例的计算和结果的分析 ,说明该算法在实际应用中是可行的 .
|
关 键 词: | 煤矿 空车分配 动态规划 计算机算法 |
Mathematical Model and Algorithm on Optimal Distribution of Vacant-Cargoes in Mine-Railway |
| |
Abstract: | In order to make the most use of the equipment and to reduce the cost in mine- railway,a re- search on the problem of how to distribute the vacantcargoes optimally in mining area with computer was made,so thatthere will be a minimal quantity of unloaded- coal in the mine.The strictmathematical defi- nition and model were builtup on it.By discussing the characters of the problem,a series of optimal crite- rions and simplified methods were given,thus reducing the scope of the problem effectively. With the dy- namic program method,an computer algorithm on the optimal solution of the problem was designed,and the complexity and effectiveness on the algorithm were analyzed. Finally,with the solution of a practical instance and the analysis of its result,it is shown thatthe algorithm is feasible in the practical work. |
| |
Keywords: | mine distribution of vacant cargoes dynamic program computer algorithm |
|
|