Novel Binary Biogeography-Based Optimization Algorithm for the Knapsack Problem
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.
KeywordsKnapsack Problem Biogeography-based optimization Migration operator mutation operator
Unable to display preview. Download preview PDF.
- 3.Stephen, C.H., Leung, Z.D.F., Zhou, C.L., Wu, T.: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional Knapsack packing problem. Computers & Operations Research 39(1), 64–73 (2010)Google Scholar
- 7.Shen, X.J., Wang, W.W., Zheng, P.J.: Modified particle swarm optimization for 0/1 Knapsack problem. Computer Engineering 32(18), 23–24, 38 (2006)Google Scholar
- 8.Gao, T., Wang, M.G.: The research for the reductive dimension and replacive variable algorithm of special restrict ILP. Systems Engineering Theory Methodology Applications 11(2), 125–130 (2002)Google Scholar
- 10.Simon, D., Mehmet, E., Dawei, D.: Population Distributions in Biogeography-based Optimization algorithms with Elitism. In: SMC, pp. 1–6 (2009)Google Scholar