Discrete Preference-Based Stepping Ahead Firefly Algorithm for Solving Multidimensional Knapsack Problems

被引：0
|
作者：
Nand, Ravneil [1 ]
Chaudhary, Kaylash [1 ]
Sharma, Bibhya [1 ]
机构：
[1] The University of the South Pacific, School of Information Technology, Engineering, Mathematics and Physics, Suva, Fiji
来源：
IEEE Access | 2024年 / 12卷
关键词：
D O I：
10.1109/ACCESS.2024.3466149
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：139154 / 139164
相关论文
共 50 条
  • [41] Firefly Algorithm for Discrete Optimization Problems: A Survey
    Tilahun, Surafel Luleseged
    Ngnotchouye, Jean Medard T.
    [J]. KSCE JOURNAL OF CIVIL ENGINEERING, 2017, 21 (02) : 535 - 545
  • [42] A quantization algorithm for solving multidimensional discrete-time optimal stopping problems
    Bally, V
    Pagés, G
    [J]. BERNOULLI, 2003, 9 (06) : 1003 - 1049
  • [43] Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm
    Gherboudj, Amira
    Layeb, Abdesslem
    Chikhi, Salim
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2012, 4 (04) : 229 - 236
  • [44] Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm
    Wu, Congcong
    Zhao, Jianli
    Feng, Yanhong
    Lee, Malrey
    [J]. APPLIED INTELLIGENCE, 2020, 50 (06) : 1872 - 1888
  • [45] “Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm”
    Congcong Wu
    Jianli Zhao
    Yanhong Feng
    Malrey Lee
    [J]. Applied Intelligence, 2020, 50 : 1872 - 1888
  • [46] Soccer league competition algorithm for solving knapsack problems
    Moosavian, Naser
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2015, 20 : 14 - 22
  • [47] A penalty algorithm for solving convex separable knapsack problems
    Hoto, R. S., V
    Matioli, L. C.
    Santos, P. S. M.
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2020, 387
  • [48] Using surrogate constraints in genetic algorithms for solving multidimensional knapsack problems
    Haul, C
    Voss, S
    [J]. ADVANCES IN COMPUTATIONAL AND STOCHASTIC OPTIMIZATION, LOGIC PROGRAMMING, AND HEURISTIC SEARCH: INTERFACES IN COMPUTER SCIENCE AND OPERATIONS RESEARCH, 1998, : 235 - 251
  • [49] Enumeration methods for repeatedly solving multidimensional knapsack sub-problems
    James, RJW
    Nakagawa, Y
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (10) : 2329 - 2340
  • [50] DGSA: discrete gravitational search algorithm for solving knapsack problem
    Sajedi, Hedieh
    Razavi, Seyedeh Fatemeh
    [J]. OPERATIONAL RESEARCH, 2017, 17 (02) : 563 - 591
12345