In this paper we present an artificial bee colony (ABC) algorithm to solve the quadratic multiple knapsack problem (QMKP) which can be considered as an extension of two well known knapsack problems viz. multiple knapsack problem and quadratic knapsack problem. In QMKP, profit values are associated not only with individual objects but also with pairs of objects. Profit value associated with a pair of objects is added to the total profit if both objects of the pair belong to the same knapsack. The objective of this problem is to assign each object to at most one knapsack in such a way that the total weight of the objects in each knapsack should not exceed knapsack's capacity and the total profit of all the objects included into the knapsacks is maximized. We have compared our approach with three genetic algorithms and a stochastic hill climber. Computational results show the effectiveness of our approach. © 2010 Springer-Verlag.
CITATION STYLE
Sundar, S., & Singh, A. (2010). A swarm intelligence approach to the quadratic multiple knapsack problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6443 LNCS, pp. 626–633). https://doi.org/10.1007/978-3-642-17537-4_76
Mendeley helps you to discover research relevant for your work.