A New Hybrid Pigeon-Inspired Optimization Algorithm for Solving Multidimensional Knapsack Problems

The Multidimensional Knapsack Problem (MKP) is an important issue in the class of knapsack problem with a wide range of applications in management and engineering. It is a combinatory optimization problem and it is also an NP-hard problem. To solve MKP, several traditional and nature-inspired search algorithms are available in the literature. In this study, a new hybrid pigeon-inspired optimization algorithm is proposed. The proposed hybridization can, efficiently, exploit the strong points of pigeon optimization algorithm in terms of solving MKP. Extensive experiments are conducted based on benchmark datasets for evaluating the performance of the proposed hybridization. The results verify that the proposed hybridization is significantly superior over the other nature-inspired algorithms used for solving MKP.