Short-term Production Scheduling’s Integrative Optimization And Application In Yimin NO.3 Open Pit

Determining open-pit mine production schedule is one of the most important problems in design and mining of open-pit mine. Production plans have long term plans and short term pains. Yimin NO.3 open pit determines long term plans that aim to achieve interal discharge sufficiently and only provides project location starting point and end point. Short term plans are not determined. It makes long term plans and specific operation results have differences. It is necessary to optimize automatically long-term plan into short-term plan.Preliminary work chooses mathematical optimum method to determine short term plans. 0-1 integer linear programming formulation that is solved at different times and 0-1 integer linear programming formulation that is solved through progressive elaboration method are created respectively. The two formulations both are the formulation that is solved at different times and do not realize global optimization. Aiming at the problem, a formulation for integrative optimization of short-term production scheduling is proposed. The formulation can work out all periods’plans in multi-period plans using one time and achieve integrative optimization.Mixed integer linear programming formulation and 0-1 integer linear programming formulation that is solved at one time are created. The mixed integer linear programming formulation does not have solution. The 0-1 integer linear programming formulation that is solved at one time is chosed. The data of 3rd opencast coal mine of Huaneng Yimin coal & power limited liability company is used to create drilling hole database firstly through 3DMine. Then geologic models are created for deposit and the models include solid models of coal seam, facial model of surface and block model of pit limit. Creating block model is in order to provide data for mathematical model. Compiling and solution of mathematical optimization model is use of mathematical software, lingo 12.0. At last, thesis conclisions are drawn and expectations are made.The 0-1 integer linear programming formulation that is solved at one time of the thesis aims to achieve interal discharge sufficiently. The constaints of the formulation include sequence constraint, advanced constraint, lag constraint, output constraints and mining constraint.