Abstract
The knapsack problem is one of the most studied combinatorial optimisation problems with various practical applications. In this paper, we apply an elite opposition-flower pollination algorithm (EFPA), to solve 0-1 knapsack problem, an NP-hard combinatorial optimisation problem. The performance of the proposed algorithm is tested against a set of benchmarks of knapsack problems. Computational experiments with a set of large-scale instances show that the EFPA can be an efficient alternative for solving 0-1 knapsack problems.
| Original language | English |
|---|---|
| Pages (from-to) | 46-53 |
| Number of pages | 8 |
| Journal | International Journal of Bio-Inspired Computation |
| Volume | 11 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2018 |
| Externally published | Yes |