An elite opposition-flower pollination algorithm for a 0-1 knapsack problem

Mohamed Abdel-Basset, Yongquan Zhou

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)

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 languageEnglish
Pages (from-to)46-53
Number of pages8
JournalInternational Journal of Bio-Inspired Computation
Volume11
Issue number1
DOIs
Publication statusPublished - 2018
Externally publishedYes

Fingerprint

Dive into the research topics of 'An elite opposition-flower pollination algorithm for a 0-1 knapsack problem'. Together they form a unique fingerprint.

Cite this