Adaptation of Binary Pigeon-Inspired Algorithm for Solving Multidimensional Knapsack Problem

Abstract

The multidimensional knapsack problem (MKP) is among the complex optimization problems that have number of practical applications in engineering domain. Several solution methods such as local search and population-based search algorithms have been proposed to solve the MKP. In this paper, a new Binary pigeon-inspired optimization (Binary PIO) algorithm is proposed for solving MKP with focus on 0–1 MKP. For the purpose evaluation, the benchmark instances drawn from the OR library are utilized to test the performance of the proposed binary method. Experimentally, it is concluded that the application of Binary PIO offers promising performance when compared with existing techniques from the literature.