Long-Term Open-Pit Mine Planning with Large Neighborhood Search

We present a large neighborhood search–based approach for solving complex, long-term, open-pit mine planning problems. An initial feasible solution, generated by a sliding windows heuristic, is improved through repeated solves of a restricted mixed-integer program. Each iteration leaves only a subset of the variables in the planning model free to take on new values. We form these subsets through the use of neighborhood formation strategies that exploit model structure. We show that our approach is able to find near-optimal solutions to problems that cannot be solved by an off-the-shelf solver in a reasonable time frame or with reasonable computational resources. Our method substantially reduces the solve times required for large models, allowing mine planners to explore multiple scenarios in a timely fashion. Our approach is being used by Rio Tinto to solve large, long-term, mine planning problems and has been responsible for generating millions of dollars in value insights.

History: This paper was refereed.

Funding: This work was supported by Rio Tinto, the University of Melbourne’s Research Computing Services, and by the Australian Research Council [Grant OPTIMA ITTC IC200100009].