Scheduling of an underground mine by combining logic based Benders decomposition and a constructive heuristic

• Main Authors: Lindh, Emil, Olsson, Kim
• Format: Others
• Language: English
• Published: Linköpings universitet, Tillämpad matematik 2021
• Subjects: Underground mine scheduling; Cut-and-fill mining; Logic-based Benders decomposition; Constructive heuristic; Computational Mathematics; Beräkningsmatematik
• Online Access: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-181412

Underground mining is a complex operation that requires careful planning. The short-term scheduling, which is the scheduling of the tasks involved in the excavation process, is an important part of the planning process. In this master thesis we propose a new method for short-term scheduling of a cut-and-fill mine operated by the mining company Boliden AB. We include a new aspect of the problem by incorporating a priority between the excavation locations of the mine. The priority feature allows the user to control the output of the scheduling and to direct resources to the locations where they are most needed according to the long-term plans. Our solution method consists of two components: a constructive heuristic method that construct a complete solution by solving partial scheduling problems containing subsets of tasks, and a logic-based Benders decomposition scheme for solving these partial problems. The computational performance of the proposed method is evaluated on industrially relevant largescale instances generated from data provided by Boliden. Comparisons are made with applying a constraint programming solver on the complete problem and with replacing the logic-based Benders scheme by applying a constraint programming solver on the partial scheduling problems, respectively. Results show that the heuristic method combined with the logic-based Benders decomposition scheme outperforms the other two methods on all instances.