Honey bee social foraging algorithms for resource allocation: Theory and application

Authors:
Nicanor Quijano;Kevin M. Passino
Affiliations:
Departamento de Ingeniería Eléctrica y Electrónica, Universidad de los Andes, Carrera 1 Este # 19A-40, Edificio Mario Laserna, Bogotá, Colombia;Department of Electrical and Computer Engineering, The Ohio State University, 2015 Neil Avenue, Columbus, OH 43210, USA
Venue:
Engineering Applications of Artificial Intelligence
Year:
2010

Citing 9
Cited 3

Resource allocation problems: algorithmic approaches

Resource allocation problems: algorithmic approaches
Ant-based load balancing in telecommunications networks

Adaptive Behavior
Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
D-Ants: savings based ants divide and conquer the vehicle routing problem

Computers and Operations Research
Ant colony optimization theory: a survey

Theoretical Computer Science
A bee colony optimization algorithm to job shop scheduling

Proceedings of the 38th conference on Winter simulation
Guest editorial: special section on ant colony optimization

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
The Ideal Free Distribution: Theory and Engineering Application

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Bee colony intelligence in zone constrained two-sided assembly line balancing problem

Expert Systems with Applications: An International Journal
Distributed clustering for group formation and task allocation in multiagent systems: A swarm intelligence approach

Applied Soft Computing
Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A model of honey bee social foraging is introduced to create an algorithm that solves a class of dynamic resource allocation problems. We prove that if several such algorithms (''hives'') compete in the same problem domain, the strategy they use is a Nash equilibrium and an evolutionarily stable strategy. Moreover, for a single or multiple hives we prove that the allocation strategy is globally optimal. To illustrate the practical utility of the theoretical results and algorithm we show how it can solve a dynamic voltage allocation problem to achieve a maximum uniformly elevated temperature in an interconnected grid of temperature zones.