Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

École Polytechnique de Montréal

$19,000.00

Short-team planning for mining operations using robust optimization

FY 2014-15

Summary
This research program aims to develop and solve a new approach for more robust planning of surface and underground mining operations in the very short-term and short-term. Operational planning determines the mining sequence for a period of three months to one year. It identifies the blocks of material to be mined out during this period and the order in which they will be. This scheduling must take into account several operational constraints such as the precedence among the blocks (among other things, to comply with safety rules on the maximum degree of slope), the precedence among the operational activities (drilling, blasting, transportation), the limit on the amount of ore that can be treated per day, the availability and the location of equipment such as shovels and drills, the access to extraction areas via ramps, etc.Traditionally, deterministic linear programming models have been used for solving operational planning. These models are effective, but they lack of realism because several of the parameters used can not be considered as deterministic: the mechanical and chemical properties of rock, the travel time of trucks, loading time, waiting time at service points, etc. These deterministic models assume accurate values for the system parameters by using a nominal value, i.e. an average value based on geostatistical studies and historical data. In real-world applications, such as those used for short-term and very short-term planning, a uncertainty in the data threatens the relevance of the solution obtained by the deterministic linear programming model in two important aspects: (i) the solution might not actually be feasible when the decision-maker attempts to implement it, and (ii) the solution, when feasible, might lead to a far greater cost (or smaller revenue) than the truly optimal strategy. The research program described in this proposal aims to overcome these drawbacks by proposing a recent approach to modeling and resolution called robust optimization.
Program
Discovery Grants Program - Individual
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
205014-2011
Name nom
Gamache, Michel
Department département
Mathématiques et génie industriel
Organization id
64
Institution établissement
École Polytechnique de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2011
Award amount
19000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
Area of application code
202
Area of application group en
Natural resources (economic aspects)
Area of application group fr
Ressources naturelles (aspects économiques)
Area of application en
Mineral resources ( prospecting, exploration, mining, extraction, processing)
Area of application fr
Ressources minérales (prospection, exploration, mines, extraction et préparation)
Research subject code
1401
Research subject group en
Mining and mineral processing
Research subject group fr
Génie minier et minéral
Research subject en
Mining engineering
Research subject fr
Génie minier
Partie
4
Nb partie
5
Application title
Short-team planning for mining operations using robust optimization
Keyword
NSERC
Application summary
This research program aims to develop and solve a new approach for more robust planning of surface and underground mining operations in the very short-term and short-term. Operational planning determines the mining sequence for a period of three months to one year. It identifies the blocks of material to be mined out during this period and the order in which they will be. This scheduling must take into account several operational constraints such as the precedence among the blocks (among other things, to comply with safety rules on the maximum degree of slope), the precedence among the operational activities (drilling, blasting, transportation), the limit on the amount of ore that can be treated per day, the availability and the location of equipment such as shovels and drills, the access to extraction areas via ramps, etc.Traditionally, deterministic linear programming models have been used for solving operational planning. These models are effective, but they lack of realism because several of the parameters used can not be considered as deterministic: the mechanical and chemical properties of rock, the travel time of trucks, loading time, waiting time at service points, etc. These deterministic models assume accurate values for the system parameters by using a nominal value, i.e. an average value based on geostatistical studies and historical data. In real-world applications, such as those used for short-term and very short-term planning, a uncertainty in the data threatens the relevance of the solution obtained by the deterministic linear programming model in two important aspects: (i) the solution might not actually be feasible when the decision-maker attempts to implement it, and (ii) the solution, when feasible, might lead to a far greater cost (or smaller revenue) than the truly optimal strategy. The research program described in this proposal aims to overcome these drawbacks by proposing a recent approach to modeling and resolution called robust optimization.
École Polytechnique de Montréal - $19,000 Grant (2014… | Canada Spends