The objective of this paper is to demonstrate that the gradient-constrained discounted Steiner point algorithm (GCDSPA) described in an earlier paper by the authors is applicable to a class of real mine planning problems, by using the algorithm to design a part of the underground access in the Rubicon gold mine near Kalgoorlie in Western Australia. The algorithm is used to design a decline connecting two ore bodies so as to maximize the net present value (NPV) associated with the connector. The connector is to break out from the access infrastructure of one ore body and extend to the other ore body. There is a junction on the connector where it splits in two near the second ore body. The GCDSPA is used to obtain the optimal location of the junction and the corresponding NPV. The result demonstrates that the GCDSPA can be used to solve certain problems in mine planning for which currently available methods cannot provide optimal solutions.

中文翻译：

---

使用贴现 Steiner 树理论的地下连接器的最佳位置

本文的目的是证明作者在早期论文中描述的梯度约束贴现施泰纳点算法（GCDSPA）适用于一类实际的矿山规划问题，通过使用该算法设计地下的一部分进入西澳大利亚 Kalgoorlie 附近的 Rubicon 金矿。该算法用于设计连接两个矿体的斜坡道，以最大化与连接器相关的净现值（NPV）。连接器是从一个矿体的通道基础设施中突围出来，延伸到另一个矿体。接头上有一个接头，在第二个矿体附近一分为二。GCDSPA 用于获得结的最佳位置和相应的 NPV。