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 条
  • [31] Application of differential evolution algorithm for solving discounted {0-1} knapsack problem
    Zhang Guang-Tao
    Zhang Nan
    Zhang Jun
    PROCEEDINGS OF 2017 IEEE 2ND INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC), 2017, : 1558 - 1561
  • [32] The performance of the modified subgradient algorithm on solving the 0-1 quadratic knapsack problem
    Sipahioglu, Aydin
    Sarac, Tugba
    20TH INTERNATIONAL CONFERENCE, EURO MINI CONFERENCE CONTINUOUS OPTIMIZATION AND KNOWLEDGE-BASED TECHNOLOGIES, EUROPT'2008, 2008, : 381 - 385
  • [33] A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem
    Shu, Zhe
    Ye, Zhiwei
    Zong, Xinlu
    Liu, Shiqin
    Zhang, Daode
    Wang, Chunzhi
    Wang, Mingwei
    APPLIED INTELLIGENCE, 2022, 52 (05) : 5751 - 5769
  • [34] Binary social group optimization algorithm for solving 0-1 knapsack problem
    Naik, Anima
    Chokkalingam, Pradeep Kumar
    DECISION SCIENCE LETTERS, 2022, 11 (01) : 55 - 72
  • [35] Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
    Wu H.
    Zhou Y.
    Luo Q.
    Zhou, Yongquan (yongquanzhou@126.com), 2018, Inderscience Enterprises Ltd. (12) : 23 - 53
  • [36] Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
    Wu, Haizhou
    Zhou, Yongquan
    Luo, Qifang
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2018, 12 (01) : 23 - 53
  • [37] Artificial Glowworm Swarm Optimization Algorithm for Solving 0-1 Knapsack Problem
    Gong, Qiaoqiao
    Zhou, Yongquan
    Yang, Yan
    SMART MATERIALS AND INTELLIGENT SYSTEMS, PTS 1 AND 2, 2011, 143-144 : 166 - 171
  • [38] An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem
    Abdollahzadeh, Benyamin
    Barshandeh, Saeid
    Javadi, Hatef
    Epicoco, Nicola
    ENGINEERING WITH COMPUTERS, 2022, 38 (SUPPL 4) : 3423 - 3444
  • [39] Solving the 0-1 knapsack problem based on a parallel intelligent molecular computing model system
    Ji, Zuwen
    Wang, Zhaocai
    Wu, Tunhua
    Huang, Wei
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2017, 33 (05) : 2719 - 2726
  • [40] Solving 0-1 Knapsack Problem Based on Immune Clonal Algorithm and Ant Colony Algorithm
    Zhao Fang
    Ma Yu-Lei
    Zhang Jun-Peng
    PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATION, ELECTRONICS AND AUTOMATION ENGINEERING, 2013, 181 : 1047 - +