Multivariant Optimization Algorithm for the 0-1 Knapsack Problem

被引:1
|
作者
Liu Lan Juan [1 ]
Li Bao Lei [1 ]
Zhang Qin Hu [1 ]
Lv Dan Jv [1 ]
Shi Xin Lin [1 ]
Li Jing Jing [1 ]
机构
[1] Yunnan Univ, Dept Elect Engn, Informat Sch, Kunming 650091, Yunnan, Peoples R China
关键词
Knapsack problem; Multivariant optimization algorithm; Multivariant search groups; Global exploration; Local exploration;
D O I
10.4028/www.scientific.net/AMM.556-562.3514
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, a novel heuristic algorithm named Multivariant Optimization Algorithm (MOA) is presented to solve the 0-1 Knapsack Problem (KP). In MOA, multivariant search groups (locate and global search groups) execute the global exploration and local exploitation iteratively to locate the optimal solution automatically. The presented algorithm has been compared with Genetic Algorithm (GA) and Particle swarm algorithm (PSO) based on five data sets, results show that the optimization of MOA is better than GA and PSO when the dimension of problem is high.
引用
收藏
页码:3514 / 3518
页数:5
相关论文
共 50 条
  • [1] ALGORITHM FOR 0-1 KNAPSACK PROBLEM
    LAURIERE, M
    [J]. MATHEMATICAL PROGRAMMING, 1978, 14 (01) : 1 - 10
  • [2] EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM
    NAUSS, RM
    [J]. MANAGEMENT SCIENCE, 1976, 23 (01) : 27 - 31
  • [3] A minimal algorithm for the 0-1 Knapsack Problem
    Pisinger, D
    [J]. OPERATIONS RESEARCH, 1997, 45 (05) : 758 - 767
  • [4] EFFICIENT ALGORITHM FOR 0-1 KNAPSACK PROBLEM
    FAYARD, D
    PLATEAU, G
    [J]. MANAGEMENT SCIENCE, 1978, 24 (09) : 918 - 919
  • [5] 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
    [J]. Applied Intelligence, 2022, 52 : 5751 - 5769
  • [6] 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
    [J]. APPLIED INTELLIGENCE, 2022, 52 (05) : 5751 - 5769
  • [7] An improved particle swarm optimization algorithm for solving 0-1 knapsack problem
    Zhang, Guo-Li
    Wei, Yi
    [J]. PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 915 - +
  • [8] Binary social group optimization algorithm for solving 0-1 knapsack problem
    Naik, Anima
    Chokkalingam, Pradeep Kumar
    [J]. DECISION SCIENCE LETTERS, 2022, 11 (01) : 55 - 72
  • [9] AN ALGORITHM FOR THE 0-1 EQUALITY KNAPSACK-PROBLEM
    RAM, B
    SARIN, S
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (11) : 1045 - 1049
  • [10] Artificial Glowworm Swarm Optimization Algorithm for Solving 0-1 Knapsack Problem
    Gong, Qiaoqiao
    Zhou, Yongquan
    Yang, Yan
    [J]. SMART MATERIALS AND INTELLIGENT SYSTEMS, PTS 1 AND 2, 2011, 143-144 : 166 - 171