Discussion on Knapsack Problem Optimization Algorithm Based on Complex Network

被引:0
|
作者
Xiao Meng [1 ]
Zhou Yunyao [2 ]
机构
[1] Wuhan Univ Technol, Int Educ Coll, Wuhan 430070, Hubei, Peoples R China
[2] Wuhan Univ Technol, Informat Engn Coll, Wuhan 430070, Hubei, Peoples R China
关键词
Knapsack problem; optimization algorithm; complex network;
D O I
10.4028/www.scientific.net/AMM.556-562.3354
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This passage is to put forward knapsack problem optimization algorithm based on complex network(KOABCN). Knapsack problem has extremely wide application in a great number of fields. For instance, knapsack problem can be applied in information coding, budget control, project choosing, material cutting, cargo loading and unloading as well as Internet information safety. Since 1950's, knapsack problem has been one of the most heated topics in algorithm and complexity research. Therefore, knapsack will still be largely focused in the next period of research.
引用
收藏
页码:3354 / +
页数:2
相关论文
共 50 条
  • [31] Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators
    Hu, Zhijun
    Li, Rong
    FRONTIERS OF MANUFACTURING SCIENCE AND MEASURING TECHNOLOGY, PTS 1-3, 2011, 230-232 : 973 - 977
  • [32] AN ALGORITHM FOR THE KNAPSACK-PROBLEM
    AKINC, U
    IIE TRANSACTIONS, 1983, 15 (01) : 31 - 36
  • [33] An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem
    Meng, Tao
    Pan, Quan-Ke
    APPLIED SOFT COMPUTING, 2017, 50 : 79 - 93
  • [34] Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm
    Huy Phuc Nguyen Ha
    Viet Hung Nguyen
    Anh Son Ta
    METAHEURISTICS, MIC 2024, PT I, 2024, 14753 : 268 - 280
  • [35] Virus-evolutionary particle swarm optimization algorithm for knapsack problem
    School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China
    Harbin Gongye Daxue Xuebao, 2009, 6 (103-107):
  • [36] An Improved Fruit Fly Optimization Algorithm for Solving Multidimensional Knapsack Problem
    Qian, Hao
    Zhang, Qing-yong
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 2494 - 2499
  • [37] Binary Mother Tree Optimization Algorithm for 0/1 Knapsack Problem
    Korani, Wael
    NEURAL INFORMATION PROCESSING, ICONIP 2023, PT I, 2024, 14447 : 201 - 213
  • [38] Multiswarm Binary Butterfly Optimization Algorithm for Solving the Multidimensional Knapsack Problem
    Shahbandegan, Shakiba
    Naderi, Madjid
    2021 29TH IRANIAN CONFERENCE ON ELECTRICAL ENGINEERING (ICEE), 2021, : 545 - 550
  • [39] An improved group theory-based optimization algorithm for discounted 0-1 knapsack problem
    Ran Wang
    Zichao Zhang
    Wing W. Y. Ng
    Wenhui Wu
    Advances in Computational Intelligence, 2021, 1 (5):
  • [40] Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
    Seulgi Joung
    Kyungsik Lee
    Optimization Letters, 2020, 14 : 101 - 113