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 条
  • [21] A new exact approach for the 0-1 Collapsing Knapsack Problem
    Della Croce, Federico
    Salassa, Fabio
    Scatamacchia, Rosario
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 260 (01) : 56 - 69
  • [22] Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization
    Feng, Yanhong
    Wang, Gai-Ge
    Deb, Suash
    Lu, Mei
    Zhao, Xiang-Jun
    NEURAL COMPUTING & APPLICATIONS, 2017, 28 (07): : 1619 - 1634
  • [23] A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem
    Zhe Shu
    Zhiwei Ye
    Xinlu Zong
    Shiqin Liu
    Daode Zhang
    Chunzhi Wang
    Mingwei Wang
    Applied Intelligence, 2022, 52 : 5751 - 5769
  • [24] Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem
    Razavi, Seyedeh Fatemeh
    Sajedi, Hedieh
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2015, 29 (05) : 2247 - 2258
  • [25] Solving Multidimensional 0-1 Knapsack Problem with an Artificial Fish Swarm Algorithm
    Azad, Md. Abul Kalam
    Rocha, Ana Maria A. C.
    Fernandes, Edite M. G. P.
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2012, PT III, 2012, 7335 : 72 - 86
  • [26] Solving the 0-1 Knapsack Problem with Polynomial-Time Quantum Algorithm
    Liu, Hongying
    Nie, Shuzhi
    COMMUNICATIONS AND INFORMATION PROCESSING, PT 2, 2012, 289 : 377 - +
  • [27] Solving 0-1 knapsack problem by a novel global harmony search algorithm
    Zou, Dexuan
    Gao, Liqun
    Li, Steven
    Wu, Jianhua
    APPLIED SOFT COMPUTING, 2011, 11 (02) : 1556 - 1564
  • [28] An improved particle swarm optimization algorithm for solving 0-1 knapsack problem
    Zhang, Guo-Li
    Wei, Yi
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 915 - +
  • [29] The Performance of the Modified Subgradient Algorithm on Solving the 0-1 Quadratic Knapsack Problem
    Sipahioglu, Aydin
    Sarac, Tugba
    INFORMATICA, 2009, 20 (02) : 293 - 304
  • [30] A novel quantum swarm evolutionary algorithm for solving 0-1 knapsack problem
    Wang, Y
    Feng, XY
    Huang, YX
    Zhou, WG
    Liang, YC
    Zhou, CG
    ADVANCES IN NATURAL COMPUTATION, PT 2, PROCEEDINGS, 2005, 3611 : 698 - 704