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 条
  • [11] A core approach to the 0-1 equality knapsack problem
    Volgenant, A
    Marsman, S
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (01) : 86 - 92
  • [12] A PBIL Algorithm for Solving 0-1 Knapsack Problem Based on Greedy Strategy
    Fang, Xiaoping
    Chen, Niansheng
    Guo, Yu
    PROCEEDINGS OF THE 2013 ASIA-PACIFIC COMPUTATIONAL INTELLIGENCE AND INFORMATION TECHNOLOGY CONFERENCE, 2013, : 664 - 672
  • [13] Solving 0-1 Knapsack Problem using Cohort Intelligence Algorithm
    Kulkarni, Anand J.
    Shabir, Hinna
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2016, 7 (03) : 427 - 441
  • [14] Solving efficiently the 0-1 multi-objective knapsack problem
    Bazgan, Cristina
    Hugot, Hadrien
    Vanderpooten, Daniel
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (01) : 260 - 279
  • [15] A new approach for solving 0/1 knapsack problem
    Chou-Yuan Lee
    Zne-Jung Lee
    Shun-Feng Su
    2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 3138 - +
  • [16] A study Report on Solving 0-1 Knapsack Problem with Imprecise Data
    Padmanabhan, Jayashree
    Swagath, S.
    2017 INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND INFORMATICS (ICCCI), 2017,
  • [17] Solving 0-1 knapsack problem by greedy degree and expectation efficiency
    Lv, Jianhui
    Wang, Xingwei
    Huang, Min
    Cheng, Hui
    Li, Fuliang
    APPLIED SOFT COMPUTING, 2016, 41 : 94 - 103
  • [18] A probabilistic solution discovery algorithm for solving 0-1 knapsack problem
    Hu, Fangxia
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2018, 33 (06) : 618 - 626
  • [19] New binary bat algorithm for solving 0-1 knapsack problem
    Rizk-Allah, Rizk M.
    Hassanien, Aboul Ella
    COMPLEX & INTELLIGENT SYSTEMS, 2018, 4 (01) : 31 - 53
  • [20] Solving 0-1 knapsack problem by binary flower pollination algorithm
    Abdel-Basset, Mohamed
    El-Shahat, Doaa
    El-Henawy, Ibrahim
    NEURAL COMPUTING & APPLICATIONS, 2019, 31 (09): : 5477 - 5495