Novel binary biogeography-based optimization algorithm for the knapsack problem

Abstract

Mathematical models of biogeography inspired the development of the biogeography-based optimization algorithm. In this article we propose a binary version of biogeography-based optimization (BBO) for the Knapsack Problem. Two new mutation operators are proposed to extend the biogeography-based optimization algorithm to binary optimization problems. We also demonstrate the performance of the resulting new binary Biogeography-based optimization algorithm in solving four Knapsack problems and compare it with that of the standard Genetic Algorithm. The simulation results show that our new method is effective and efficient for the Knapsack problem. © 2012 Springer-Verlag.