July 2019
Volume 71    Issue 7

Openpit mine optimization with maximum satisfiability

Deutsch, Matthew


Full-text paper:
Mining, Metallurgy & Exploration, https://doi.org/10.1007/s42461-019-0062-x

A common casualty of modern openpit mine optimization is the assurance that the resulting design is actually achievable. Optimized mine plans that consider value and a bare minimum of precedence constraints do not, in general, translate into practical, operational mine designs that can be used in the field. Ultimate pits may come to a sharp point at the bottom. Schedules may require taking small parcels of material from many disparate areas of the pit in a single period, and grade control polygons may be ragged, narrow and not minable with realistic equipment. In this paper, these three fundamental openpit mine optimization problems are addressed by encoding them as maximum satisfiability problems. Maximum satisfiability provides a useful framework for problems that are nonlinear and may guarantee the optimality that metaheuristics cannot.


Follow these easy steps if you are an SME member:
  • Go to www.smenet.org/login . Sign in with your email address and password.
  • Hover your mouse over “Publications and Resources” in the top banner. Click on “Mining, Metallurgy & Exploration (MME) Journal” in the pull-down menu.
  • Scroll down and click on the “Read the MME Journal Online” button, which will take you to the Springer site as an SME member who is eligible for free access. (To see published papers on the Springer site, click on “Browse Volumes & Issues” in the blue banner.)
If you are not an SME member, go to https://www.springer.com/engineering/journal/42461 for paid access. Or join SME at www.smenet.org/join