摘要
讨论露天矿生产的车辆调度问题,关键是如何分配和调度现有条件下的电铲和卡车,从而得到一个好的生产计划.通过对问题的进一步分析和合理的简化,根据总定量最小原则及产量最大原则分别建立了相应的动态规划模型.由于模型在解决具体问题过程中的复杂程度和变量、不等式约束条件的个数太多等原因,我们采用逐步优化法对模型作了进一步的改进,然后用LINGO、LINDO等数学软件编程进行模型求解,得到了根据总定量最小原则及产量最大原则下的计划方案.
In this paper, the problem of vehicle dispatch for opencut mine production were discussed, How were distributed and dispatched power shovel and trucks now available condition, thus a nice plan production was obtained. By means of the problem further analyse and rational simplify. According total quantity least principle and output greatest principle corresponding dynamic programming model respectively was established. Bue to model was complicated and variable inequality restrain condition number greatest many etc. We use progressively optimizaton what model was further improved. After that, LINGO, LINDO of mathematics software was used compile programming modet to answer. The plan was obtained according total quantity least principle and output greatest principle.
出处
《数学的实践与认识》
CSCD
北大核心
2006年第7期267-274,共8页
Mathematics in Practice and Theory
关键词
动态规划
逐步优化法
车辆调度
露天
bynamic programming
progressively optimizaton
vehicle dispatch
opencut