Executable by design: the MineLib McLaughlin benchmark
Optimisation has a reputation problem in mine planning, and it was earned. Plans that score well in a solver routinely turn out to be impractical, and the work of making them practical destroys much of the value they appeared to create. So the number in the study and the number the site can deliver are not the same number, and planners have learned not to trust the gap.
This benchmark measures that gap on a public dataset, then shows what a plan looks like when the constraints are built in from the start.
What we tested
MineLib is a public library of open pit mining problems, set up as the mining equivalent of MIPLIB and used as a common reference set across the field. It is published at minelib.org and described in Espinoza, Goycoolea, Moreno and Newman, "MineLib: a library of open pit mining problems", Annals of Operations Research 206(1), 2013.
We took McLaughlin, a defunct gold mine in California and the largest instance in the library at 2,140,342 blocks, together with the best-known published solution for it. That solution is a strong one. MineLib records its gap to the linear programming upper bound at 0.2%, so against the model it was given it is close to the best answer available.
The instance economics are the library's own and unchanged: gold at $900 per ounce, mining cost $1.32 per ton, processing cost $19 per ton, 90% recovery, and a 15% discount rate.
The model those economics sit in is the issue. The published problem schedules every block individually with no fleet, no haulage, no drill-and-blast timing and no capital model at all.
What happens when the constraints are charged
We replayed the published schedule and required it to obey the physical constraints a real operation works under: processing capacity, active dig-face separation, equipment operating-hour budgets, haulage and waste destination capacity, cross-campaign precedence, and drill-and-blast preparation time. Fleet purchase capital is charged. Nothing about the deposit, the economics or the discount rate changes.
| Published solution | Same schedule, constraints charged | |
|---|---|---|
| Discounted NPV | $1,510,126,435 | $603,659,267 |
Around 60% of the stated value does not survive. The largest single cause is timing. Roughly 95% of the published schedule's first-period mill feed cannot physically be reached that early, principally because drill-and-blast preparation takes time, and partly because a limited number of dig faces can only strip so much material at once. That feed moves later, and discounting erodes it.
This is not a criticism of the solution or of the people who produced it. It answers the model it was handed extremely well. The model simply does not describe a mine.
What Cognomine produced
Same deposit. Same economics. Same discount rate. Same fleet capital treatment. The difference is that the constraints above are inside the problem from the beginning rather than applied to the answer afterwards.
| Constraints charged after | Cognomine | |
|---|---|---|
| Discounted NPV | $603,659,267 | $916,203,292 |
| Undiscounted cashflow | $2,248,824,621 | $1,808,604,872 |
The Cognomine plan carries $312,544,025 more NPV, at 151.8% of the practicalised comparator, on a plan that satisfies every constraint listed above.
The undiscounted line points the other way, and the reason matters. The published schedule moves around 2.6 times more total material and processes roughly 17% more ore, so its undiscounted total is higher. It over-selects, because nothing in its model told it that reaching material takes time and equipment. The Cognomine plan is more selective and better sequenced, and holds far more of its value once time is priced in.
Ore left in the ground
Every mine plan leaves ore in the ground. Deciding what is worth extracting and what is not is one of the central judgements in a strategic plan, and both plans here make it. The difference is what informs the decision.
Both plans compute the cutoff as they go rather than taking a fixed grade, and both work from the same raw block data. The difference is what the calculation can see. Cognomine prices the fleet, haulage and drill-and-blast time needed to reach a block, so material that costs more to reach than it returns is left in place. The published formulation has no way to represent those costs, so its cutoff is computed as though reaching a block were free. That is why it moves more rock and processes more ore for less value.
Both plans above are solved to maximise net present value. Recovery, production rate, cost profile and capital sequencing can each be set as the objective instead, and a plan built to maximise recovery would mine more of this deposit and return a lower NPV. Which of those a site wants is a commercial decision, not a solver setting we make on its behalf.
What this benchmark does not show
- Constraints are deliberately not identical. That is the point of the comparison. The published solution was produced against a model with no fleet, haulage, drill-and-blast timing or capital. This is not a like-for-like contest between two solvers on the same problem.
- The practicalised replay is our construction. We defined the rules by which the published schedule is made to obey physical constraints. Those rules are documented and available on request.
- The replay inherits the published block selection. It is made to obey the physical constraints but cannot re-choose what to mine, because the published formulation has no way to express fleet, haulage or drill-and-blast timing and so cannot be re-solved under them. That limitation is the finding rather than a flaw in the method, but it does mean the replay is not the best plan a constraint-aware solver would build from the same selection.
- The problem definitions differ. The published formulation cannot represent a stockpile. Cognomine can. Real operations have stockpiles, which is why we model one, but it is a difference in the problem being solved and not only in the answer. The stockpile in this run is finite, at 50 million tons, smaller than one carried by a producing site we work with, and it operates strictly first in, first out. Material cannot be held back and retrieved out of order to favour grade.
- This benchmark makes no speed claim. No runtime was published for the comparator, so there is nothing to measure against. Speed results are on the strategic planning benchmark.
- This run was above the supported production limit. The 2,140,342 block model was solved at full resolution to show what the solver can do. Cognomine production accounts accept raw block models up to around one million blocks, and every model is reduced to scheduling units before solving: under 100,000 in a standard run, up to 500,000 in High Fidelity. Reblocking reduces spatial resolution rather than constraints, and on a model of this size it would return a lower NPV than the figure above. High Fidelity narrows that gap by working at finer resolution, at a longer solve time, and is included in every credit. How reblocking and High Fidelity work
- This is one deposit. It is the first result in a series. Further MineLib instances are in progress and will be published here as they complete.
Why it matters
A plan is only worth what a site can execute. The value lost between the two figures above is why experienced planners discount optimisation output before they read it, and they are right to.
Cognomine models the constraints that shape a real mine plan from the start, so the number it produces is a number the operation can work towards.
Run it on your own numbers
Sources: MineLib PCPSP instance mclaughlin and the best-known published solution mclaughlin_pcpsp_gmunoz120723.sol, objective 1,510,126,435 at a 0.2% gap to the linear programming upper bound, retrieved from minelib.org on 2 September 2026. The library is also mirrored at mansci-web.uai.cl/minelib.
The solution was provided by Gonzalo Muñoz and obtained from the LP relaxation using a modified TopoSort heuristic: Muñoz Martínez, G. I. (2012), Modelos de optimización lineal entera y aplicaciones a la minería, master's thesis, Department of Mathematical Engineering, Universidad de Chile. Open access at repositorio.uchile.cl/handle/2250/111132.
The library is described in Espinoza, D., Goycoolea, M., Moreno, E. and Newman, A. (2013), "MineLib: a library of open pit mining problems", Annals of Operations Research 206(1), 93 to 114, doi:10.1007/s10479-012-1258-3.
Cognomine results are our own. Full method for the practicalised replay available on request.
