Promoting the spread of knowledge and supporting businesses through win-win relationships

The MiningMath software allows mining engineers to improve their strategic analysis through risk assessments that are unconstrained by a step-wise approach to optimization. MiningMath’s optimization methodology helps to integrate multiple areas of the business, handling all parameters simultaneously and delivering multiple scenarios, accounting for both strategic and tactical aspects.

Even the greatest engineers and algorithms might…

Zoomed in

…miss opportunities, when one decision limits the next one.

Zoomed out

MiningMath optimization is not constrained by arbitrary decisions for cut-off grades or pushbacks, since these decisions are usually guided by prior knowledge or automated trial-and-error. Thus, each set of constraints in our technology has the potential to deliver an entirely new project development, including economic, technical, and socio-environmental indicators, along with a mine schedule, while aiming to maximize the project’s NPV.

The mining planning models that follow a step-wise methodology have developed shortcuts and approximations to try and deliver acceptable results that consider all the project’s complexities and constraints. To handle it, powerful machines are required, in order to find a solution and simultaneously determine the optimum pit limit and mining sequence that deliver the maximum project value.

Figure 1 depicts a stepwise approach to optimization.

Figure 1: Representation of a step-wise approach from block model, nested pits, pushbacks, and schedules until short-term planning. Several strategies, algorithms or technologies can be employed in each step.

This step-wise approach is usually solved in three larger individual stages:

  1. Nested pits: when finding nested pits, it's possible to employ the Lerchs-Grossmann (LG) algorithm, the Pseudoflow algorithm, destination optimization, direct block scheduling, or even more recent heuristic mechanisms.

  2. Pushback definition: having defined nested pits, the next step would usually be to manually perform the definition of pushbacks, which is done by some expert mine planning engineers using a number of empirical rules. Automatic ways focused on NPV optimization could also be employed for pushback design, but these are usually under resource constraints and do not consider enough geometric requirements.

  3. Schedules: finally, starting from a chosen pushback, the scheduling is performed. A myriad of techniques can be employed for that, such as direct block scheduling, genetic algorithms, (fuzzy) clustering algorithms, dynamic programming, and heuristic methods in general. All with different rates of success, but limited variety of solutions due to the single pushback input.

Regardless of the technologies or algorithms, in a stepwise approach the aim is to initially find the final pit limit that maximizes the undiscounted cash flow, to then focus on block sequence within this final pit envelope. By constraining the problem and predefining inputs, these shortcuts (approximations) help to save time and computer resources, enabling such software to consider complexities such as ore blending requirements, different processing routes, stockpiling policy, truck fleet considerations, and so on.

With the step-wise approach, thousands of potential schedules can be generated with a multitude of different methods, but they are all based on the same step-wise rationale, with one step guiding the next ones. Commonly, schedules follow from a set of nested pits and other fixed input parameters such as geotechnics, metallurgical performance, blending constraints, etc. Therefore, the results frequently present similar behaviours and restrict the full exploration of the solution space.

What if...

Your nested pits do not lead to feasible production plans?

Your pushbacks do not account for your blending needs?

Your short-term planning does not fit the long-term view?

Other geometric conditions could be tested for a better NPV?

Your cutoffs and sequence incur higher mining rates and stocks?

When using MiningMath, it is possible to define the pit limit and mine schedule simultaneously. That is, to determine which blocks should be mined, when this should happen and to where they should be sent to maximize the NPV, while respecting production and operational constraints, slope angles, discount rate, stockpiles, among others, all performed straight from the block model. This means that the steps of pit optimization, pushback and scheduling are not obtained separately, but in a single and optimized process.

MiningMath acknowledges that each project has its own characteristics. Thus, it also allows you to choose which workflow fits best in your demand and decide which one should be used. For example, you could use it to define your Super Best Case for free. As MiningMath optimizes all periods simultaneously, without the need for revenue factors, it has the potential to find higher NPVs than traditional best case procedures based on LG/Pseudoflow nested pits, which do not account for processing capacities (gap problems), cutoff policy optimization and discount rate. Usually, these and many other real-life aspects are only accounted for later, through a stepwise process, limiting the potentials of the project. 

MiningMath also offers the option of producing Optimized Pushbacks with controlled ore production and operational designs to guide your mine sequencing. Having this broader view in mind, you are already able to begin the scheduling stage, with Optimized Schedules. The block’s periods and destinations optimized by MiningMath could be imported back into your preferred mining package, for comparison, pushback design or scheduling purposes.

To help with all that, our software allows you to build Decision Trees, which enable a broader view of your project and a deeper understanding of the impacts of each variable. This is all possible because MiningMath works with a global optimization which simultaneously regards all variables, instead of following a step-wise approach. MiningMath provides different views and solutions for each parameter changed and each possible objective on the same mine, as depicted in Figure 2.

Figure 2: Representation of the single-step approach employed by MiningMath, straight
block model to short-term, schedules, optimized pushbacks or super best case.

Do not over constrain!

Identify your bottlenecks before going into detailed planning

Check how each constraint interacts with each other

Test how each assumption impacts the economics

Search for realistic lower risk and higher potential scenarios

Reveal hundreds of unseen distinctive solutions!

OK, but I need proof!

Sure! Such unbelievable results are only possible due to MiningMath’s proprietary Math Programming Solver ©. It consists of a Mixed Integer Linear Programming (MILP) formulation and linearization methods that tackle the challenging non-linear aspects of the mining optimization. It also has its own Branch & Cut algorithm, which provides more efficiency than standard MILP optimizers since it’s fine-tuned to this specific optimization problem. 

Another major advantage of MiningMath comes from the mathematical formulations based on surfaces (Goodwin et al., 2006; Marinho, 2013), instead of usual block precedences. Block precedence methods might lead to higher errors (Beretta and Marinho, 2014), providing steeper slopes (i.e. riskier, more optimistic) than requested. The use of surfaces eliminates geotechnical errors and  allows for block-by-block geotechnical zones, if needed. They also allow MiningMath to include geometric constraints and, consequently, find solutions that are closer to real mining operations. You can guide geometries by including mining and bottom widths, mining lengths, maximum vertical advance rates, and forcing/restricting mining areas. Such constraints give freedom for you to work, or not, with predefined cut-offs and pushbacks which might limit the space of potential solutions.

All that is explained in our Knowledge Base, while you can also use our forums to interact with the community and have any questions answered. MiningMath’s approach has been applied for years by our customers, with an increasing number of licenses sold worldwide, press releases and academic research also proving the consistency of the implementation.

With constant developments since 2013, MiningMath has reached a mature and robust state, providing solutions straight from the block model (Figure 4). It is the first and only single-step mining optimization engine available in the market!

Figure 4: MiningMath’s approach. From block model to schedule in a single step solved by its proprietary Math Programming Solver ©.

Protected: Imperial system

There is no excerpt because this is a protected post.

In-depth MiningMath

This tutorial provides a detailed guidance to the pages in the knowledge base fo...

Theory Validation

MiningMath’s results are only possible due to its proprietary Math Program...

Guaranteed Solutions

Multiple, complex constraints increase the likelihood of not finding or not exis...

MiningMath Uniqueness

MiningMath allows mining managers to improve their strategic analysis through ri...

Time Limit

It is possible to indicate a time limit in hours before running a scenario in th...

Must read articles

In order to take the maximum of MiningMath’s Optimization we recommend this fl...





Formatting the Block Model

The main focus here is on the requirements. Try to pay attention to the header...

Chat Icon Close Icon