MineLib: a library of open pit mining problems. Similar to the mixed-integer programming library (MIPLIB), we present a library of publicly available test problem instances for three classical types of open pit mining problems: the ultimate pit limit problem and two variants of open pit production scheduling problems. The ultimate pit limit problem determines a set of notional three-dimensional blocks containing ore and/or waste material to extract to maximize value subject to geospatial precedence constraints. Open pit production scheduling problems seek to determine when, if ever, a block is extracted from an open pit mine. A typical objective is to maximize the net present value of the extracted ore; constraints include precedence and upper bounds on operational resource usage. Extensions of this problem can include $(i)$ lower bounds on operational resource usage, $(ii)$ the determination of whether a block is sent to a waste dump, i.e., discarded, or to a processing plant, i.e., to a facility that derives salable mineral from the block, $(iii)$ average grade constraints at the processing plant, and $(iv)$ inventories of extracted but unprocessed material. Although open pit mining problems have appeared in academic literature dating back to the 1960s, no standard representations exist, and there are no commonly available corresponding data sets. We describe some representative open pit mining problems, briefly mention related literature, and provide a library consisting of mathematical models and sets of instances, available on the Internet. We conclude with directions for use of this newly established mining library. The library serves not only as a suggestion of standard expressions of and available data for open pit mining problems, but also as encouragement for the development of increasingly sophisticated algorithms.

References in zbMATH (referenced in 11 articles , 1 standard article )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Muñoz, Gonzalo; Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Queyranne, Maurice; Letelier, Orlando Rivera: A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling (2018)
  2. Johnson, Benjamin; Newman, Alexandra; King, Jeffrey: Optimizing high-level nuclear waste disposal within a deep geologic repository (2017)
  3. Samavati, Mehran; Essam, Daryl; Nehring, Micah; Sarker, Ruhul: A local branching heuristic for the open pit mine production scheduling problem (2017)
  4. Jélvez, Enrique; Morales, Nelson; Nancel-Penard, Pierre; Peypouquet, Juan; Reyes, Patricio: Aggregation heuristic for the open-pit block scheduling problem (2016)
  5. Mousavi, Amin; Kozan, Erhan; Liu, Shi Qiang: Comparative analysis of three metaheuristics for short-term open pit block sequencing (2016)
  6. Vossen, Thomas W. M.; Wood, R. Kevin; Newman, Alexandra M.: Hierarchical benders decomposition for open-pit mine block sequencing (2016)
  7. Lamghari, Amina; Dimitrakopoulos, Roussos; Ferland, Jacques A.: A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines (2015)
  8. Blom, Michelle L.; Burt, Christina N.; Pearce, Adrian R.; Stuckey, Peter J.: A decomposition-based heuristic for collaborative scheduling in a network of open-pit mines (2014)
  9. Lambert, W. B.; Newman, A. M.: Tailored Lagrangian relaxation for the open pit block sequencing problem (2014)
  10. Papageorgiou, Dimitri J.; Nemhauser, George L.; Sokol, Joel; Cheon, Myun-Seok; Keha, Ahmet B.: MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results (2014)
  11. Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Newman, Alexandra: MineLib: a library of open pit mining problems (2013)