Application of the bee swarm optimization BSO to the knapsack problem

7Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Swarm Intelligence is the part of Artificial Intelligence based on study of actions of individuals in various decentralized systems. The optimization algorithms which are inspired from intelligent behavior of honey bees are among the most recently introduced population based techniques. In this paper, a novel hybrid algorithm based in Bees Algorithm and Particle Swarm Optimization is applied to the Knapsack Problem. The Bee Algorithm is a new population-based search algorithm inspired by the natural foraging behavior of honey bees, it performs a kind of exploitative neighborhood search combined with random explorative search to scan the solution, but the results obtained with this algorithm in the Knapsack Problem are not very good. Although the combination of BA and PSO is given by BSO, Bee Swarm Optimization, this algorithm uses the velocity vector and the collective memories of PSO and the search based on the BA and the results are much better. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sotelo-Figueroa, M. A., Baltazar, R., & Carpio, M. (2010). Application of the bee swarm optimization BSO to the knapsack problem. Studies in Computational Intelligence, 312, 191–206. https://doi.org/10.1007/978-3-642-15111-8_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free