A 0-1 knapsack problem-based approach for solving open-pit mining problem with type-2 fuzzy parameters

被引:1
|
作者
Pramanik, Aparna [1 ]
Changdar, Chiranjit [2 ]
Khan, Abhinandan [3 ]
Chatterjee, Snehamoy [4 ]
Pal, Rajat Kumar [1 ]
Sahana, Sudip Kumar [5 ]
机构
[1] Univ Calcutta, Dept Comp Sci & Engn, Kolkata 700106, W Bengal, India
[2] Belda Coll, Dept Comp Sci, Paschim Medinipur 721424, W Bengal, India
[3] ARP Engn, Prod Dev & Diversificat, Kolkata 700056, W Bengal, India
[4] Michigan Technol Univ, Dept Geol & Min Engn & Sci, Houghton, MI 49931 USA
[5] Birla Inst Technol, Dept Comp Sci & Engn, Mesra 835215, Jharkhand, India
关键词
0-1 Knapsack problem; Critical value reduction method; Genetic algorithm; Immigration; Open-pit mining problem; Type-2 fuzzy number; PRODUCTION SCHEDULING PROBLEM; GLOBAL HARMONY SEARCH; PRODUCTION PHASE; ALGORITHM; OPTIMIZATION; DESIGN; VARIABLES; MODEL;
D O I
10.1007/s11334-022-00491-1
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Open-pit mining has several non-deterministic polynomial-time hard (NP-hard) 0-1 knapsack problems. The complexities of these problems are also increased due to some uncertain input parameters. This paper proposed an innovative hybrid fuzzy logic and genetic algorithm-based approach for solving a critical open-pit mining problem. First, the uncertainty of this problem is incorporated within the type-2 fuzzy environment, where the critical value reduction method was used to defuzzify the objective value. Next, genetic algorithm was used to solve the optimisation problem iteratively using a special initial solution generator, unique mutation, refinement, and immigration operations. Some benchmark instances from KPLIB were solved to show the effectiveness of the proposed hybrid fuzzy type-2 and genetic algorithm approach. The benchmark results show the proposed method can generate optimum solutions. Finally, a few OPMP instances from MineLib were solved using the proposed technique to demonstrate the applicability of this research to actual cases under fuzziness. The case study results indicated that the proposed approach can effectively solve the open-pit optimisation problem and similar NP-hard knapsack problems.
引用
收藏
页码:165 / 178
页数:14
相关论文
共 50 条
  • [41] A MSM-PGA Based on Multi-Agent for Solving 0-1 Knapsack Problem
    Zhao, Tinghong
    Yang, Lizhi
    Man, Zibin
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, 2008, : 898 - 902
  • [42] A modified artificial bee colony approach for the 0-1 knapsack problem
    Cao, Jie
    Yin, Baoqun
    Lu, Xiaonong
    Kang, Yu
    Chen, Xin
    APPLIED INTELLIGENCE, 2018, 48 (06) : 1582 - 1595
  • [43] Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem
    Moraga, RJ
    DePuy, GW
    Whitehouse, GE
    COMPUTERS & INDUSTRIAL ENGINEERING, 2005, 48 (01) : 83 - 96
  • [44] An efficient tabu search approach for the 0-1 multidimensional knapsack problem
    Hanafi, S
    Freville, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) : 659 - 675
  • [45] A modified artificial bee colony approach for the 0-1 knapsack problem
    Jie Cao
    Baoqun Yin
    Xiaonong Lu
    Yu Kang
    Xin Chen
    Applied Intelligence, 2018, 48 : 1582 - 1595
  • [46] Probability Maximization Model of 0-1 Knapsack Problem with Random Fuzzy Variables
    Hasuike, Takashi
    Katagiri, Hideki
    Ishii, Hiroaki
    2008 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-5, 2008, : 548 - +
  • [47] A new approach for solving intuitionistic fuzzy transportation problem of type-2
    Sujeet Kumar Singh
    Shiv Prasad Yadav
    Annals of Operations Research, 2016, 243 : 349 - 363
  • [48] A new approach for solving intuitionistic fuzzy transportation problem of type-2
    Singh, Sujeet Kumar
    Yadav, Shiv Prasad
    ANNALS OF OPERATIONS RESEARCH, 2016, 243 (1-2) : 349 - 363
  • [49] Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division
    Ye, Lian
    Zheng, Jinhang
    Guo, Ping
    Perez-Jimenez, Mario J.
    IEEE ACCESS, 2019, 7 : 66055 - 66067
  • [50] An Improved Shuffled Frog-Leaping Algorithm to Solving 0-1 Knapsack Problem
    Zhang, Jianhao
    Jiang, Wei
    Zhao, Kang
    IEEE ACCESS, 2024, 12 : 148155 - 148166