Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Basset et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: