A Discrete Improved Artificial Bee Colony Algorithm for 0–1 Knapsack Problem
The present study integrated a discrete search equation to develop a discrete improved artificial bee colony (DiABC) algorithm. A random binary population was added in the initialization. The current optimal solution was then introduced into the search equations for worker and onlooker bees to effec...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8769945/ |
| Summary: | The present study integrated a discrete search equation to develop a discrete improved artificial bee colony (DiABC) algorithm. A random binary population was added in the initialization. The current optimal solution was then introduced into the search equations for worker and onlooker bees to effectively enhance the convergence accuracy of the algorithm. And a new selection method on scout bees was proposed. Eighteen benchmark knapsack problems (KPs) experiments were conducted, of which the results validated the effectiveness of the DiABC algorithm in optimizing the KPs. |
|---|---|
| ISSN: | 2169-3536 |