Authors: Mohamed Abdel-Basset; Yongquan Zhou
Addresses: Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, El-Zera Square, Zagazig, Sharqiyah, Egypt ' College of Information Science and Engineering, Guangxi University for Nationalities, Nanning 530006, China
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.
Keywords: flower pollination algorithm; meta-heuristics; combinatorial optimisation; NP-hard; optimisation; knapsack problems.
International Journal of Bio-Inspired Computation, 2018 Vol.11 No.1, pp.46 - 53
Available online: 23 Feb 2018 *Full-text access for editors Access for subscribers Free access Comment on this article