Multi-Objective Robust Optimization for Planning of Mineral Processing under Uncertainty

被引:2
|
作者
Xu, Quan [1 ]
Zhang, Kesheng [1 ]
Li, Mingyu [1 ]
Chu, Yangang [1 ]
Zhang, Danwei [1 ]
机构
[1] Northeastern Univ, State Key Lab Synthet Automat Proc Ind, Shenyang 110004, Peoples R China
关键词
Mineral Processing; Production Indices Optimization; Multi-objective Optimization; Robust Optimization; EVOLUTIONARY ALGORITHMS;
D O I
10.1109/CCDC52312.2021.9601660
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The planning of mineral processing is crucial for improving the utilization ratio of nonrenewable raw mineral resources. However, in the optimization process, the uncertainty of raw ore grade poses a very important issue and it directly affects the optimization performance. To address the above-mentioned issues, an improved multi-objective robust optimization algorithm is proposed, which employs NSGA-II as the basic component assisted by the random elite immigrant scheme and robustness evaluation in batches strategy. The proposed strategy aims at realizing the optimization of the planning of mineral processing. Using real data from a mineral processing plant on iron ore beneficiation process has been carried out. Experiment results show that the proposed strategy can efficiently achieve the Pareto front of the multi-objective robust optimization problem under the disturbance.
引用
收藏
页码:4020 / 4027
页数:8
相关论文
共 50 条
  • [41] Robust Multi-Objective Bayesian Optimization Under Input Noise
    Daulton, Samuel
    Cakmak, Sait
    Balandat, Maximilian
    Osborne, Michael A.
    Zhou, Enlu
    Bakshy, Eytan
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
  • [42] A Multi-objective Risk-averse Workforce Planning under Uncertainty
    Jalalvand, Fatemeh
    Turan, Hasan Huseyin
    Elsawah, Sondoss
    Ryan, Michael J.
    [J]. 2020 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2020, : 1626 - 1633
  • [43] Sustainable Multi-objective Planning of Biomass Conversion Systems under Uncertainty
    Santibanez-Aguilar, Jose E.
    Morales-Rodriguez, Ricardo
    Gonzalez-Campos, Janett B.
    Ponce-Ortega, Jose M.
    [J]. PRES15: PROCESS INTEGRATION, MODELLING AND OPTIMISATION FOR ENERGY SAVING AND POLLUTION REDUCTION, 2015, 45 : 367 - 372
  • [44] Multi-objective planning of community energy storage systems under uncertainty
    Anuradha, K. B. J.
    Iria, Jose
    Mediwaththe, Chathurika P.
    [J]. ELECTRIC POWER SYSTEMS RESEARCH, 2024, 230
  • [45] A Sequential Multi-Objective Robust Optimization Approach Under Interval Uncertainty Based on Support Vector Machines
    Xie, Tingli
    Zhou, Qi
    Hu, Jiexiang
    Shu, Leshi
    Jiang, Ping
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2017, : 2088 - 2092
  • [46] A multi-objective fuzzy robust optimization approach for designing sustainable and reliable power systems under uncertainty
    Tsao, Yu-Chung
    Vo-Van Thanh
    [J]. APPLIED SOFT COMPUTING, 2020, 92
  • [47] A MULTI-OBJECTIVE ROBUST OPTIMIZATION APPROACH UNDER INTERVAL UNCERTAINTY BASED ON KRIGING AND SUPPORT VECTOR MACHINE
    Xie, Tingli
    Jiang, Ping
    Zhou, Qi
    Shu, Leshi
    Yang, Yang
    [J]. PROCEEDINGS OF THE ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, 2018, VOL 2B, 2018,
  • [48] Integrated scheduling of energy supply and demand in microgrids under uncertainty: A robust multi-objective optimization approach
    Wang, Luhao
    Li, Qiqiang
    Ding, Ran
    Sun, Mingshun
    Wang, Guirong
    [J]. ENERGY, 2017, 130 : 1 - 14
  • [49] Multi-Objective A* Algorithm for the Multimodal Multi-Objective Path Planning Optimization
    Jin, Bo
    [J]. 2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 1704 - 1711
  • [50] Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
    Raith, Andrea
    Schmidt, Marie
    Schoebel, Anita
    Thom, Lisa
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (02) : 628 - 642