A Novel Bat algorithm of solving 0-1 Knapsack Problem

被引：0
|
作者：
Chen, Yanfeng [1 ]
机构：
[1] Gansu Normal Univ Nationalities, Hezuo 747000, Gansu, Peoples R China
来源：
PROCEEDINGS OF THE 2016 4TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTING TECHNOLOGY | 2016年 / 60卷
关键词：
Bat Algorithm; 0-1 knapsack problem; active evolutionary operator; invalid bat;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
0-1 knapsack problem is a typical NP complete problem. In this paper, based on the bat algorithm, combined with the idea of genetic variation, the paper introduces the processing rules of the active evolutionary operator, invalid bat and the current optimal position. The simulation results show that the algorithm is superior to the basic bat algorithm in convergence speed and accuracy, and it can effectively solve the 0-1 knapsack problem.
引用
收藏
页码：1598 / 1601
页数：4
相关论文
共 50 条
  • [21] Application of differential evolution algorithm for solving discounted {0-1} knapsack problem
    Zhang Guang-Tao
    Zhang Nan
    Zhang Jun
    PROCEEDINGS OF 2017 IEEE 2ND INFORMATION TECHNOLOGY, NETWORKING, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (ITNEC), 2017, : 1558 - 1561
  • [22] The performance of the modified subgradient algorithm on solving the 0-1 quadratic knapsack problem
    Sipahioglu, Aydin
    Sarac, Tugba
    20TH INTERNATIONAL CONFERENCE, EURO MINI CONFERENCE CONTINUOUS OPTIMIZATION AND KNOWLEDGE-BASED TECHNOLOGIES, EUROPT'2008, 2008, : 381 - 385
  • [23] 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
    APPLIED INTELLIGENCE, 2022, 52 (05) : 5751 - 5769
  • [24] Binary social group optimization algorithm for solving 0-1 knapsack problem
    Naik, Anima
    Chokkalingam, Pradeep Kumar
    DECISION SCIENCE LETTERS, 2022, 11 (01) : 55 - 72
  • [25] Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
    Wu H.
    Zhou Y.
    Luo Q.
    Zhou, Yongquan (yongquanzhou@126.com), 2018, Inderscience Enterprises Ltd. (12) : 23 - 53
  • [26] Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
    Wu, Haizhou
    Zhou, Yongquan
    Luo, Qifang
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2018, 12 (01) : 23 - 53
  • [27] Artificial Glowworm Swarm Optimization Algorithm for Solving 0-1 Knapsack Problem
    Gong, Qiaoqiao
    Zhou, Yongquan
    Yang, Yan
    SMART MATERIALS AND INTELLIGENT SYSTEMS, PTS 1 AND 2, 2011, 143-144 : 166 - 171
  • [28] A PBIL Algorithm for Solving 0-1 Knapsack Problem Based on Greedy Strategy
    Fang, Xiaoping
    Chen, Niansheng
    Guo, Yu
    PROCEEDINGS OF THE 2013 ASIA-PACIFIC COMPUTATIONAL INTELLIGENCE AND INFORMATION TECHNOLOGY CONFERENCE, 2013, : 664 - 672
  • [29] An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem
    Abdollahzadeh, Benyamin
    Barshandeh, Saeid
    Javadi, Hatef
    Epicoco, Nicola
    ENGINEERING WITH COMPUTERS, 2022, 38 (SUPPL 4) : 3423 - 3444
  • [30] Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization
    Feng, Yanhong
    Wang, Gai-Ge
    Deb, Suash
    Lu, Mei
    Zhao, Xiang-Jun
    NEURAL COMPUTING & APPLICATIONS, 2017, 28 (07): : 1619 - 1634
12345