An artificial bee colony algorithm for the 0-1 multidimensional knapsack problem

Abstract

In this paper, we present an artificial bee colony (ABC) algorithm for the 0-1 Multidimensional Knapsack Problem (MKP-01). The objective of MKP-01 is to find a subset of a given set of n objects in such a way that the total profit of the objects included in the subset is maximized, while a set of knapsack constraints remains satisfied. The ABC algorithm is a new metaheuristic technique based on the intelligent foraging behavior of honey bee swarms. Heuristic-based repair operators and local search are incorporated into our ABC algorithm. Computational results demonstrate that our ABC algorithm not only produces better results but converges very rapidly in comparison with other swarm-based approaches. © 2010 Springer-Verlag Berlin Heidelberg.