عنوان مقاله [English]
Optimization of stope boundaries has received less attention than that in open pit mines. However, few algorithms are available for optimization of stope boundaries, which are either tailored for a specific mining method or lack some significant geometrical and technical constraints. A greedy algorithm is described in this paper for optimization of stope boundaries in each level of an underground mine. The algorithm employs a graph of the 2D economic block model in which weight of edges indicate cumulative economic values of blocks. The proposed algorithm enjoys Dijikstra approach to find the maximum path length on the graph. Dijikstra method is one of the best methods for solving the greedy algorithms. Indeed, the path which is searched in model of mining area using this algorithm, defines limits of the optimized stopes which provide the highest economic value.