用户名: 密码: 验证码:
露天矿多目标配矿模型与优化算法研究
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Research of Multi-objective Ore Blending Model and Optimization Algorithm in Open-pit Mine
  • 作者:顾清华 ; 孟倩倩 ; 卢才武 ; 马龙
  • 英文作者:GU Qinghua;MENG Qianqian;LU Caiwu;MA Long;School of Management,Xian University of Architecture and Technology;
  • 关键词:露天矿 ; 多金属 ; 多目标 ; 配矿 ; 自适应粒子群算法
  • 英文关键词:Open-pit mine;;Multi metal;;Multi-objective;;Ore blending;;Adaptive particle swarm optimization algorithm
  • 中文刊名:KYYK
  • 英文刊名:Mining Research and Development
  • 机构:西安建筑科技大学管理学院;
  • 出版日期:2019-02-25
  • 出版单位:矿业研究与开发
  • 年:2019
  • 期:v.39;No.223
  • 基金:国家自然科学基金资助项目(51774228);; 陕西省自然科学基金项目(2017JM5043)
  • 语种:中文;
  • 页:KYYK201902004
  • 页数:6
  • CN:02
  • ISSN:43-1215/TD
  • 分类号:24-29
摘要
针对露天矿的多金属多目标短期配矿问题,提出了基于自适应粒子群算法的露天矿配矿优化方法。首先,结合矿山配矿实际生产要求和指标,构建了以运输功和配矿品位偏差最小为目标函数的多目标短期配矿模型。其次,在基本粒子群算法的基础上,采用Kent映射产生初始种群,使种群分布更加均匀;并将自适应概率引入到粒子群算法,提高了种群的多样性和算法的全局搜索能力。最后,以一个算例和三道庄露天矿配矿的实际数据为例,进行仿真验证,仿真结果表明:该优化方法适用于解决露天矿多金属多目标的配矿问题,可以有效降低配矿过程中的运输功和品位偏差。
        In view of the problem of multi metal and multi-objective short-term ore blending in open-pit mine,an optimization method for open-pit mine blending was put forward based on adaptive particle swarm optimization algorithm.Firstly,combined with the actual production requirements and indexes of ore blending,a multi-objective short-term ore blending model was constructed with the objective of minimizing the deviation of transport power and ore blending grade.Secondly,based on the basic particle swarm optimization algorithm,the initial population was generated by kent mapping,so that the initial population was evenly distributed.The adaptive probability was introduced into the particle swarm optimization algorithm,which improved the diversity of the population and the global search ability of the algorithm.Finally,Taking a numerical example and the actual data of three open-pit mines as an example,the simulation and verification were carried out.The simulation results showed that the ore blending model could effectively solve the problem of multi metal and multi-objective ore blending in open-pit mine,and effectively reduce the transport power and grade deviation during the ore blending process.
引文
[1]陈鹏能,张电吉,李志国,等.昆阳磷矿数字配矿优化模型与配矿工艺规程[J].武汉工程大学学报,2012,34(10):37-40.
    [2]Wen Sheng Liu,Fu Ping Li.Iron Ore Blending Based on Linear Programming[J].Applied Mechanics and Materials,2014(443):657-661.
    [3]王晓婷,卢才武,张英春,等.三道庄露天矿多矿种综合配矿动态管理信息系统[J].金属矿山,2012(8):98-102.
    [4]吴丽春,王李管,彭平安,等.露天矿配矿优化方法研究[J].矿冶工程,2012,12(4):8-12.
    [5]李国清,李宝,胡乃联,等.地下金属矿山采掘作业计划优化模型[J].工程科学学报,2017(3):342-348.
    [6]林启太.未确知数学在研究混合配矿中的应用[J].系统工程理论与实践,2002,22(1):99-102.
    [7]Arenas M,Bilbao A,Rodriguez M V.Solving a multi-objective possibility problem through compromise programming[J].Eur J Oper Res,2005:164-748.
    [8]Xu T J,Yang P.Application of improved genetic algorithm in mine ore blending[C]//Thr 3rd Internationed Symposium on Modern Mining and Safety Technology Proceedings.Fuxin:China Coal Industry Publishing House,2008(8):174.
    [9]黄启富,陈建宏.基于PSO的矿山企业动态配矿优化研究[J].计算机工程,2011,37(8):175-177.
    [10]徐铁军,杨鹏.基于模糊多目标优化算法的矿山配矿优化[J].北京科技大学学报,2009,31(11):1363-1367.
    [11]姚旭龙,胡乃联,周立辉,等.基于免疫克隆选择优化算法的地下矿山配矿[J].北京科技大学学报,2011,33(5):526-531.
    [12]李志国,崔周全.基于遗传算法的多目标优化配矿[J].广西大学学报(自然科学版),2013,38(5):1230-1238.
    [13]Peng G,Fang Y W,Peng W S,et al.Multi-objective particle optimization algorithm based on sharing-learning and dynamic crowding distance[J].Optik-Ijternational Journal for Light and Electron Optics,2016,127(12):5013-5020.
    [14]Shokrian M,High K A.Application of a multi objective multi-leader particle swarm optimization algorithm on NLPand MINLP problems[J].Computers&Chemical Engineering,2014,60(2):57-75.
    [15]贾永基,郭文娟,杨东.多目标独占性电动汽车路径问题建模与优化[J].工业工程与管理,2017,22(5):1-8.
    [16]张策,孙小明.基于多目标规划与组织间关系的供应商选择方法[J].工业工程与管理,2014,19(1):58-64.
    [17]刘宝宁,章卫国,李广文,等.一种改进的多目标粒子群优化算法[J].北京航空航天大学报,2013(4):462-473.
    [18]瓮纪昌,张云政,黄超勇,等.栾川三道庄特大型钼钨矿床地质特征及矿床成因[J].地质与勘探,2010(1):41-48.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700