Migrating Birds Optimization (MBO) algorithm to solve 0-1 multidimensional knapsack problem

This study presents Migrating Birds Optimization (MBO) which is a novel meta-heuristic algorithm for the solution of 0-1 multidimensional knapsack problem. In the study, the basic migrating birds optimization algorithm is used and change is made to the only neighborhood structure of this algorithm for adapting to the addressed problem. The performance of the algorithm is examined on the test problems that selected from OR-library. The obtained results show that the migrating birds optimization algorithm has achieved successful results in 0-1 multidimensional backpack problems.