An Integer Programming Algorithm for Stope Layout Optimization

Optimization of underground stope is defined as looking for a boundary with the highest profit considering technological and geometrical constraints. The first algorithms were presented about five decades ago for optimization of mining limits. Most of algorithms, presented till now, have been applied for optimization of open pit limits. Few algorithms have been presented for Underground cases, most of which have been tailored for a specific mining method or lack rigorous techniques. There are, however, some rigorous algorithms but they fail to provide 3D solution,. In this paper, a new algorithm is introduced to optimize stope layout using integer programming (IP) technique. The algorithm is implemented on a specific model, derived from conventional block model. It is a rigorous algorithm and provides a realistic optimum solution, compared to its alternatives. For the first time, two more constraints, namely the minimum width of rib pillars and the maximum stope height, are considered in the proposed algorithm.