A Novel Bat algorithm of solving 0-1 Knapsack Problem

DOI

10.2991/icmmct-16.2016.318How to use a DOI?

Keywords

Bat Algorithm; 0-1 knapsack problem; active evolutionary operator; invalid bat

Abstract

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.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yanfeng Chen
PY  - 2016/03
DA  - 2016/03
TI  - A Novel Bat algorithm of solving 0-1 Knapsack Problem
BT  - Proceedings of the 2016 4th International Conference on Machinery, Materials and Computing Technology
PB  - Atlantis Press
SP  - 1597
EP  - 1600
SN  - 2352-5401
UR  - https://doi.org/10.2991/icmmct-16.2016.318
DO  - 10.2991/icmmct-16.2016.318
ID  - Chen2016/03
ER  -