利用贴现斯坦纳树理论求解地下连接器的最优位置

K. G. Sirinanda, M. Brazil, P. A. Grossman, J. Rubinstein, D. Thomas
{"title":"利用贴现斯坦纳树理论求解地下连接器的最优位置","authors":"K. G. Sirinanda, M. Brazil, P. A. Grossman, J. Rubinstein, D. Thomas","doi":"10.1017/S1446181120000231","DOIUrl":null,"url":null,"abstract":"Abstract 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.","PeriodicalId":74944,"journal":{"name":"The ANZIAM journal","volume":"17 1","pages":"334 - 351"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"OPTIMAL LOCATION OF AN UNDERGROUND CONNECTOR USING DISCOUNTED STEINER TREE THEORY\",\"authors\":\"K. G. Sirinanda, M. Brazil, P. A. Grossman, J. Rubinstein, D. Thomas\",\"doi\":\"10.1017/S1446181120000231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract 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.\",\"PeriodicalId\":74944,\"journal\":{\"name\":\"The ANZIAM journal\",\"volume\":\"17 1\",\"pages\":\"334 - 351\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The ANZIAM journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/S1446181120000231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The ANZIAM journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/S1446181120000231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

摘要本文的目的是通过对西澳大利亚Kalgoorlie附近Rubicon金矿部分地下通道的设计,证明前人提出的梯度约束贴现斯坦纳点算法(GCDSPA)适用于一类实际的矿山规划问题。该算法用于设计连接两个矿体的衰落,以使连接的净现值(NPV)最大化。接头是从一个矿体的接入基础设施中突围而出并延伸到另一个矿体。在接头上有一个连接点,在第二矿体附近它分成两部分。利用GCDSPA得到了最优的结点位置和相应的NPV。结果表明,GCDSPA可用于解决现有方法无法提供最优解的矿山规划问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
OPTIMAL LOCATION OF AN UNDERGROUND CONNECTOR USING DISCOUNTED STEINER TREE THEORY
Abstract 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信