TITLE

MineLib: a library of open pit mining problems

AUTHOR(S)
Espinoza, Daniel; Goycoolea, Marcos; Moreno, Eduardo; Newman, Alexandra
PUB. DATE
July 2013
SOURCE
Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p93
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
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.
ACCESSION #
88349740

 

Related Articles

  • A genetic algorithm for the simultaneous lot sizing and scheduling problem in capacitated flow shop with complex setups and backlogging. Babaei, M.; Mohammadi, M.; Ghomi, S. // International Journal of Advanced Manufacturing Technology;Jan2014, Vol. 70 Issue 1-4, p125 

    In this paper the capacitated lot sizing and scheduling problem with sequence-dependent setups, setup carryover, and backlogging has been studied. The problem can be formulated as a mixed-integer program. Most lot sizing problems are hard to solve, especially in medium and large scale. In recent...

  • Mathematical model and supporting algorithm to aid the sequencing and scheduling of mining with loading equipment allocation. Andrade, Arthur; Santoro, Miguel; de Tomi, Giorgio // Rem: Revista Escola de Minas;Oct-Dec2014, Vol. 67 Issue 4, p379 

    This paper focuses on the sequencing and scheduling problem of open pit mining, with the allocation of loading equipment considering a medium-term horizon. This study considers the existence of a heterogeneous loading equipment fleet and two types of mineable material, namely ore or waste rock....

  • Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP). Pinto, Gaby; Ben-Dov, Yariv; Rabinowitz, Gad // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p311 

    The main motivation of this study is to provide, for the first time, a formulation and solution for a class of production scheduling problems (as in cluster tools) characterized mainly by resource collaboration to perform an operation and while allowing batches and considering alternative...

  • A 0–1 integer linear programming approach to schedule outages of nuclear power plants. Jost, V.; Savourey, D. // Journal of Scheduling;Dec2013, Vol. 16 Issue 6, p551 

    We address the problem of planning outages of nuclear power plants submitted by EDF (Électricité De France) as the challenge EURO/ROADEF 2010. As our team won the first prize of the contest in the senior category, our approach may be of interest: it is conceptually simple, easy to program...

  • Robust Optimization of Schedules Affected by Uncertain Events. Vujanic, Robin; Goulart, Paul; Morari, Manfred // Journal of Optimization Theory & Applications;Dec2016, Vol. 171 Issue 3, p1033 

    In this paper, we present a new method for finding robust solutions to mixed-integer linear programs subject to uncertain events. We present a new modeling framework for such events that result in uncertainty sets that depend parametrically on the decision taken. We also develop results that can...

  • Two-stage flow-shop scheduling problem with non-identical second stage assembly machines. Navaei, J.; Ghomi, S. M. T. Fatemi; Jolai, F.; Shiraqai, M. E.; Hidaji, H. // International Journal of Advanced Manufacturing Technology;Dec2013, Vol. 69 Issue 9-12, p2215 

    This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear...

  • Solving a Location, Allocation, and Capacity Planning Problem with Dynamic Demand and Response Time Service Level. Carrie Ka Yuk Lin // Mathematical Problems in Engineering;2014, p1 

    Logistic systems with uncertain demand, travel time, and on-site processing time are studied here where sequential trip travel is allowed. The relationship between three levels of decisions: facility location, demand allocation, and resource capacity (number of service units), satisfying the...

  • A mathematical model for scheduling of real-world tree-structured multi-product pipeline system. Mostafaei, Hossein; Alipouri, Yagub; Zadahmad, Manouchehr // Mathematical Methods of Operations Research;Feb2015, Vol. 81 Issue 1, p53 

    In this paper, a mathematical model to petroleum derivatives transportation scheduling is developed. The problem discussed in this paper is concerned with the scheduling of one-source tree-structured pipeline connected to several output terminals. A tree-structured pipeline is composed of a...

  • A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem. Jalilvand-Nejad, Amir; Fattahi, Parviz // Journal of Intelligent Manufacturing;Dec2015, Vol. 26 Issue 6, p1085 

    Product orders are usually released with a cyclic manner, in the part manufacturing industries. Hence, scheduling cyclic jobs instead of single jobs is more practical in the real manufacturing environment. In this paper, a flexible job shop scheduling problem with cyclic jobs is studied. In this...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics