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

Simple item page
dc.contributor.author Sundar, Shyam
dc.contributor.author Singh, Alok
dc.contributor.author Rossi, André
dc.date.accessioned 2022-03-27T06:04:03Z
dc.date.available 2022-03-27T06:04:03Z
dc.date.issued 2010-09-29
dc.description.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.
dc.identifier.citation Communications in Computer and Information Science. v.94 CCIS(PART 1)
dc.identifier.issn 18650929
dc.identifier.uri 10.1007/978-3-642-14834-7_14
dc.identifier.uri http://link.springer.com/10.1007/978-3-642-14834-7_14
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/9248
dc.subject Artificial bee colony algorithm
dc.subject combinatorial optimization
dc.subject heuristic
dc.subject multidimensional knapsack problem
dc.subject swarm intelligence
dc.title An artificial bee colony algorithm for the 0-1 multidimensional knapsack problem
dc.type Book Series. Conference Paper
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download
Collections
Computer and Information Sciences - Publications