Интеллектуальный поиск точных решений задачи планирования открытых горных работ

Abstract

A method of intelligent search for accurate solutions to the planning of open-pit mining has been developed. The method is implemented within the framework of the Constraint Programming Paradigm that allows us to process heterogeneous qualitative and quantitative constraints (in particular, economic, technological, etc.) simultaneously, as well as to maintain the model of subject domain being developed which is open to adding new constraints or deleting existing constraints. Various constraints can be added to the model, including those for which it is difficult to find a suitable analytical expression. In contrast to existing methods of local search the proposed method systematically explores the search space. The method allows us to find a global optimum in large dimensional spaces that describe practically significant problems arising in production. Currently, to solve this problem, the methods of integer linear programming are widely used. But its fundamental disadvantage is the need to represent all the constraints in the form of linear equalities and inequalities. However, in practice, some combinatorial optimization problems cannot be linearized and solved using traditional methods of mathematical programming. The developed method is illustrated by the example of a three-dimensional problem of finding the position of an intermediate pit wall by the processing periods taking into account the specified performance for mineral and overburden rocks and the objective profit function taking into account discounting. The types of constraints necessary for modeling the problem under consideration are identified. The possibility of applying the existing inference procedures on constraints is considered for these types. The method proposed makes it possible to obtain accurate solutions due to the intellectualization of the solution process by using highly efficient algorithms of reducing the search space for each type of constraints and specialized heuristics for pruning unpromising alternatives in the search tree.