期刊文献+

提高露天煤矿开采计划动态排序优化效率的算法 被引量:2

Algorithm to Improve the Efficiency of Dynamic Sequencing Optimization of Production Schedule in Open-pit Coal Mines
原文传递
导出
摘要 现有露天煤矿开采计划动态排序优化的一般模型,在同时优化生产能力、开采顺序、开采寿命三要素得到最佳计划过程中,需要限制产能上下限区间,若上下限区间太窄,可能错过最佳产能,区间太宽则会花费较长计算时间。鉴于此,提出用移动求解域算法及随机波动算法来解决该问题。移动求解域算法按照一定区间宽度逐次移动年产能约束区间,算出每次移动的约束区间中的"本地最佳计划",待约束区间覆盖产能上下限后,从所有"本地最佳计划"选出全局最佳计划;而随机波动算法则是通过随机地波动移动求解域算法中得到的最佳计划的产能,得出新的最佳计划,来对比验证移动求解域算法的最佳计划是否最优。应用案例结果表明,动态排序优化的一般模型配合移动求解域算法及随机波动算法优化露天煤矿开采计划并得出最优开采方案用时4 min,比单独用一般模型优化的50 h用时快了750倍,运算效率得到显著提升。 The existing general model of dynamic sequencing optimization of production schedule in open-pit coal mines needs to limit the upper and lower regions of production capacity in the process of optimizing the three elements of production capacity,mining sequence and mining life to obtain the best plan at the same time.If the upper and lower regions are too narrow,the best production capacity may be missed,and if the area is too wide,it will take a long time to calculate.In view of this problem,a mobile domain algorithm and a random fluctuation algorithm are proposed.The mobile domain algorithm moves the annual production capacity constraint interval successively according to a certain interval width,and calculates the"local best plan"in the constraint interval of each movement.After the constraint interval covers the upper and lower limits of the production capacity,the global best plan can be selected from all"local best plans".The random fluctuation algorithm is to randomly fluctuate the production capacity of the best plan obtained in the mobile domain algorithm to achieve a new best plan,and verify whether the best plan obtained in the mobile domain algorithm is optimal by comparison.The application case results show that the general dynamic sequencing optimization model combined with the mobile domain algorithm and the random fluctuation algorithm to optimize the production schedule of open-pit coal mines takes 4 minutes,which is 750 times faster than the 50 hours optimized by the general model alone,and the efficiency has been significantly improved.
作者 孔文源 顾晓薇 王青 胥孝川 KONG Wenyuan;GU Xiaowei;WANG Qing;XU Xiaochuan(School of Resources and Civil Engineering,Northeastern University,Shenyang,Liaoning 110819,China)
出处 《矿业研究与开发》 CAS 北大核心 2021年第11期199-204,共6页 Mining Research and Development
基金 国家自然科学基金资助项目(51674062,51974060,52074061,U1903216)。
关键词 露天煤矿 开采计划优化 动态排序优化模型 移动求解域算法 随机波动算法 Open-pit coal mine Production schedule optimization Dynamic sequencing optimization model Mobile domain algorithm Random fluctuation algorithm
  • 相关文献

参考文献5

二级参考文献16

  • 1F·哈拉里 李慰莹译.图论[M].上海:上海科学技术出版社,1980..
  • 2李慰莹.图论[M].长沙:湖南科学技术出版社,1980..
  • 3李宝祥.金属矿床开采[M].北京:冶金工业出版社,1970..
  • 4李修眭.图论导引[M].武汉:华中工学院出版社,1982..
  • 5Crawford J T,Davey R K.Case study in openpit limit analysis[C]//Computer Methods for the 80s in the Mineral Industry.New York,1979:311-318.
  • 6Belobraidich W.Computer assisted long range mine planning practice at ray mine division—Kennecott copper corporation[C]//Computer Methods for the 80’s in the Mineral Industry.New York,1979:349-357.
  • 7Savage C J,Preller A H.Computerized mine planning system at Rio Tinto Mineral,S.A.(Spain)[C]//Proceedings of the 19th Application of Computers and Operations Research in the Mineral Industry.Universal Park,1987:441-456.
  • 8Halatchev R A.A model of discounted profit variation of open pit production sequencing optimization[C]//Proceedings of the 32nd International Symposium on the Application of Computers and Operations Research in the Mineral Industry.Tucson,2005:315-323.
  • 9Ramazan S.The new fundamental tree algorithm for production scheduling of open pit mines[J].European Journal of Operations Research,2006,177(2):1153-1166.
  • 10Armstrong M,Galli A.A new approach to flexible open pit optimization and scheduling[C]//Proceedings of the 35th International Symposium of Application of Computers and Operations Research in the Minerals Industry.Wollongong,2011:253-263.

共引文献38

同被引文献23

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部