Binary improved particle swarm optimization algorithm for knapsack problem

被引:0
|
作者
College of Management, University of Shanghai for Science and Technology, Shanghai 200093, China [1 ]
机构
来源
Shanghai Ligong Daxue Xuebao | 2006年 / 1卷 / 31-34期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] Improved particle swarm optimization algorithm for the stochastic loader problem
    Zhao Pei-xin
    ICIEA 2007: 2ND IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, VOLS 1-4, PROCEEDINGS, 2007, : 773 - 776
  • [22] An Improved Particle Swarm Optimization Algorithm for Quadratic Assignment Problem
    Congying, L., V
    2012 FOURTH INTERNATIONAL CONFERENCE ON MULTIMEDIA INFORMATION NETWORKING AND SECURITY (MINES 2012), 2012, : 258 - 261
  • [23] An improved particle swarm optimization algorithm for flowshop scheduling problem
    Li, Bo
    Zhang, Changsheng
    Bai, Ge
    Zhang, Erliang
    2008 INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, VOLS 1-4, 2008, : 1226 - +
  • [24] An improved particle swarm optimization algorithm for flowshop scheduling problem
    Zhang, Changsheng
    Sun, Jigui
    Zhu, Xingiun
    Yang, Qingyun
    INFORMATION PROCESSING LETTERS, 2008, 108 (04) : 204 - 209
  • [25] An Improved Particle Swarm Optimization Algorithm for the Travelling Salesman Problem
    Ahmed, A. K. M. Foysal
    Sun, Ji Ung
    ADVANCED SCIENCE LETTERS, 2016, 22 (11) : 3318 - 3322
  • [26] A Diversification-based Quantum Particle Swarm Optimization Algorithm for the Multidimensional Knapsack Problem
    Lai, Xiangjing
    Hao, JinKao
    Yue, Dong
    Gao, Hao
    PROCEEDINGS OF 2018 5TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTELLIGENCE SYSTEMS (CCIS), 2018, : 315 - 319
  • [27] Research on the Fast Particle Swarm Optimization Algorithm for Arbitrarily Constrained Multidimensional Knapsack Problem
    Ding, Luwei
    Kang, KunPeng
    Kang, Bin
    Wang, Jianyong
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2012, 15 (09): : 3849 - 3853
  • [28] A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem
    Lin, Geng
    Guan, Jian
    Li, Zuoyong
    Feng, Huibin
    EXPERT SYSTEMS WITH APPLICATIONS, 2019, 135 : 201 - 211
  • [29] A Novel Multi-Mutation Binary Particle Swarm Optimization for 0/1 knapsack problem
    Li, Zhuangkuo
    Li, Ning
    CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 3042 - 3047
  • [30] Path Planning Based on Improved Binary Particle Swarm Optimization Algorithm
    Zhang Qiaorong
    Gu Guochang
    Zhang Qiaorong
    2008 IEEE CONFERENCE ON ROBOTICS, AUTOMATION, AND MECHATRONICS, VOLS 1 AND 2, 2008, : 470 - +