Optimization of underground mine development system using fuzzy shortest path length algorithm

Abstract

Graphic mine design elements denote physical entities such as shafts, declines, and drives. Ore deposits are often composed of independent orebodies that must be interconnected into one integrated system. In this paper, we examine a case where access points to orebodies lie in the Euclidean plane. The key question is how to interconnect these points at minimal cost. This design problem is modeled as a network and the solution technique is outlined. We supposed that the locations of access points had been previously determined. To define the ore reserves in each orebody, we used linguistic variables and their transformation to fuzzy triangular numbers. At first, we used Kruskal’s algorithm to identify the minimum spanning tree. After that, by inserting Steiner points we defined a Steiner minimal tree as the global minimum. In a network created in such a way, it is necessary to locate a point called the major mass concentration point to which excavated ore will be delivered; from there, the excavated ore will be hauled or hoisted to a surface breakout point via an optimal development system. In this paper, we use the fuzzy shortest path length procedure to select an optimal development system.

Keywords:

• underground mine development
• Kruskal algorithm
• Steiner point
• fuzzy shortest path length

Acknowledgments

This paper is part of research conducted on scientific projects TR33003 and TR33025, which were funded by the Ministry of Science and Technological Development, Republic of Serbia. The authors wish to thank the anonymous referees for their careful reading and constructive comments on the paper.