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
来源：
MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY | 2014年 / 556-562卷
关键词：
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 条
  • [21] Migrating birds optimization (MBO) algorithm to solve knapsack problem
    Ulker, Erkan
    Tongur, Vahit
    8TH INTERNATIONAL CONFERENCE ON ADVANCES IN INFORMATION TECHNOLOGY, 2017, 111 : 71 - 76
  • [22] Hybrid Ant Colony Optimization Algorithm for Multiple Knapsack Problem
    Fidanova, Stefka
    2020 5TH IEEE INTERNATIONAL CONFERENCE ON RECENT ADVANCES AND INNOVATIONS IN ENGINEERING (IEEE - ICRAIE-2020), 2020,
  • [23] Multivariant Optimization Algorithm for the 0-1 Knapsack Problem
    Liu Lan Juan
    Li Bao Lei
    Zhang Qin Hu
    Lv Dan Jv
    Shi Xin Lin
    Li Jing Jing
    MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY, 2014, 556-562 : 3514 - 3518
  • [24] Analysis and Optimization of the Packing Tree Search Algorithm for the Knapsack Problem
    Slonkina, Irina
    Kupriyashin, Mikhail
    Borzunov, Georgii
    PROCEEDINGS OF THE 2019 IEEE CONFERENCE OF RUSSIAN YOUNG RESEARCHERS IN ELECTRICAL AND ELECTRONIC ENGINEERING (EICONRUS), 2019, : 1811 - 1815
  • [25] A new ant colony optimization algorithm for the multidimensional Knapsack problem
    Kong, Min
    Tian, Peng
    Kao, Yucheng
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (08) : 2672 - 2683
  • [26] Binary improved particle swarm optimization algorithm for knapsack problem
    College of Management, University of Shanghai for Science and Technology, Shanghai 200093, China
    Shanghai Ligong Daxue Xuebao, 2006, 1 (31-34):
  • [27] A Fast Particle Swarm Optimization Algorithm for the Multidimensional Knapsack Problem
    Bonyadi, Mohammad Reza
    Michalewicz, Zbigniew
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [28] A Pointer Network Based Deep Learning Algorithm for 0-1 Knapsack Problem
    Gu, Shenshen
    Hao, Tao
    PROCEEDINGS OF 2018 TENTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI), 2018, : 473 - 477
  • [29] A Lagrangean based solution algorithm for the knapsack problem with setups
    Amiri, Ali
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 143
  • [30] An Optimal Parallel Algorithm for the Knapsack Problem Based on EREW
    李肯立
    蒋盛益
    王卉
    李庆华
    Journal of Southwest Jiaotong University, 2003, (02) : 131 - 137
12345