Sequential optimization heuristic algorithm for the mine planning problem in open-pit mines

The block sequencing problem in open-pit mines is considered NP-difficult due to its combinatorial properties. Solving it through mathematical programming is unfeasible due to the high computational time required. This work presents a heuristic algorithm of sequential optimization, based on mathematical programming, to solve the period-by-period problem. In this algorithm, each subproblem for a period is solved optimally by a mathematical programming solver. The algorithm was tested on two block models representing real mines and made publicly available by the MineLib library. The results obtained by the heuristic sequential optimization algorithm are close to the best results presented by MineLib. Our contributions include sharing the code developed, allowing other researchers to have a starting point to develop even better solutions than those presented here.