论文部分内容阅读
动态规划是解决多阶段决策过程的最优化问题的一种方法。它可以分为若干个相互联系的各个阶段,每一个阶段的决策确定以后,就完全确定了一个过程的活动路线。各个阶段的决策确定以后,就构成了一个“决策序列”。这个“决策序列”的效果在预定的条件下是最优的。我们利用动态规划使整个过程取得最优的效果的特点,将矿体沿走向方向分成若干个横剖面,以赢利最大为原则,按照边坡稳定角及开采顺序约束条件进行开采方块的多段决策,求得总赢利最大的露天境界。(一)数学模型与方法这里所说的三
Dynamic programming is a way to solve the optimization problem of multi-stage decision process. It can be divided into a number of interrelated stages, after each stage of the decision-making to determine, fully determine the course of an activity. After the various stages of the decision-making to determine, it constitutes a “decision-making sequence.” The effect of this “decision sequence” is optimal under the predetermined conditions. We use the dynamic programming to make the whole process achieve the best effect. The ore body is divided into several cross-sections along the direction of the trend. Based on the principle of maximum profit, we make multi-stage decision-making of mining blocks according to the stability angle of the slope and the constraints of the mining sequence, Get the maximum total profit of the open-air realm. (A) Mathematical Models and Methods Here are three