Aggregation heuristic for the open-pit block scheduling problem

Enrique Jélvez, Nelson Morales, Pierre Nancel-Penard, Juan Peypouquet*, Patricio Reyes

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

41 Citations (Scopus)

Abstract

In order to establish a production plan, an open-pit mine is partitioned into a three-dimensional array of blocks. The order in which blocks are extracted and processed has a dramatic impact on the economic value of the exploitation. Since realistic models have millions of blocks and constraints, the combinatorial optimization problem of finding the extraction sequence that maximizes the profit is computationally intractable. In this work, we present a procedure, based on innovative aggregation and disaggregation heuristics, that allows us to get feasible and nearly optimal solutions. The method was tested on the public reference library MineLib and improved the best known results in the literature in 9 of the 11 instances of the library. Moreover, the overall procedure is very scalable, which makes it a promising tool for large size problems.

Original languageEnglish
Pages (from-to)1169-1177
Number of pages9
JournalEuropean Journal of Operational Research
Volume249
Issue number3
DOIs
Publication statusPublished - 16-Mar-2016
Externally publishedYes

Keywords

  • Block aggregation
  • Heuristics
  • Integer programming
  • Mine planning
  • Open-pit block scheduling

Cite this