郭进平,王靖,李角群

• 1:西安建筑科技大学材料与矿资学院

摘要(Abstract)：

中深孔爆破广泛用于金属矿山开采,针对传统炮孔排面布置设计方法绘图工作量大、计算繁重、炮孔总长难以得到最优化的缺点,根据最短路径寻优原理,以孔底距限定选择排面炮孔,将起始炮孔作为起始点,炮孔长度作为权值,把炮孔布置转化为单源最短路径问题,利用Dijkstra算法,在AutoCAD平台上进行二次开发,对中深孔排面布孔设计进行优化研究。实现了中深孔爆破布置设计数字化及其炮孔排面布置方案最优化。结果表明:基于最短路径算法的炮孔布置方案可使炮孔总长缩短约10%,降低了凿岩成本,经济效益显著。

关键词(KeyWords)： 炮孔布置优化;最短路径问题;Dijkstra;AutoCAD二次开发

Abstract:

Keywords:

基金项目(Foundation):

作者(Author): 郭进平,王靖,李角群

参考文献(References)：

• [1]郭建来.对无底柱分段崩落采矿法的工艺研究[J].河北企业,2015(5):154.[1]GUO Jian-lai.Study on technology of sublevel caving mining method[J].The Enterprise of Hebei,2015(5):154.(in Chinese)
• [2]张国建.无底柱分段崩落法理论与实践的新认识[J].中国矿业,2004,13(2):60-62.[2]ZHANG Guo-jian.New understanding of theory and practice of pillarless sublevel caving method[J].China Mining Magazine,2004,13(2):60-62.(in Chinese)
• [3]邹勇.金川二矿区深部采矿回采进路布置与回采顺序优化研究[D].长沙:中南大学,2007.[3]ZOU Yong.Study on layout and mining sequence optimization of deep mining in second mining area of Jinchuan[D].Changsha:Central South University,2007.(in Chinese).
• [4]兰建.计算机技术在地下矿山中深孔设计中的应用研究[D].西安:西安建筑科技大学,2003.[4]LAN Jian.APPlieation and study of computer technology in medium length blasting design at underground iron ore mines[D].Xi'an:Xi'an University of Architecture and Technology,2003.(in Chinese)
• [5]易洪武.向上扇形中深孔爆破参数优化[J].现代矿业,2015,555(7):39-40,51.[5]YI Hong-wu.Optimization of blasting parameters for upward medium deep hole[J].Modern Mining,2015,555(7):39-40,51.(in Chinese)
• [6]陈星明,肖正学,谭诚.小型露天采石场中深孔爆破方案优化设计[J].爆破,2012,29(1):45-47.[6]CHENG Xing-ming,XIAO Zheng-xue,TAN Cheng.Optimization design of medium-length hole blasting in smallscale and opencast quarry[J].Blasting,2012,29(1):45-47.(in Chinese)
• [7]王志坚,韩伟一,李一军,等.具有多条最短路径的最短路问题[J].哈尔滨工业大学学报,2010,42(9):1428-1431.[7]WANG Zhi-jian,HAN Wei-yi,LI Yi-jun,et al.Shortest path problem with multiple shortest paths[J].Journal of Harbin Institute of Technology,2010,42(9):1428-1431.(in Chinese)
• [8]王荣,江东,韩惠.基于Floyd方法的最短路径算法优化算法[J].甘肃科学学报,2012,24(4):110-114.[8]WANG Rong,JIANG Dong,HAN Hui.An optimized approach for shortest path determination based on floyd algorithm[J].Journal of Gansu Sciences,2012,24(4):110-114.(in Chinese)
• [9]张广林,胡小梅,柴剑飞,等.路径规划算法及其应用综述[J].现代机械,2011(5):85-90.[9]ZHANG Guang-lin,HU Xiao-mei,CHAI Jian-fei,et al.Summary of path planning algorithm and its application[J].Modern Machinery,2011(5):85-90.(in Chinese)
• [10]张钟.大规模图上的最短路径问题研究[D].合肥:中国科学技术大学,2014.[10]ZHANG Zhong.Study of shortest path problem on largescale graph[D].Hefei:University of Science and Technology of China,2014.(in Chinese)
• [11]王树西,李安渝.Dijkstra算法中的多邻接点与多条最短路径问题[J].计算机科学,2014,41(6):217-224.[11]WANG Shu-xi,LI An-huai.Multi-adjacent-vertexes and multi-shortest-paths problem of Dijkstra algorithm[J].Computer Science,2014,41(6):217-224.(in Chinese)