Bio-Inspired Computing and Networking

Social Insect Societies of Dynamic NP-Hard Problems

■

63

Wasp swarm optimization is based on how wasps compete between themselves

in the swarm, forming an hierarchy based on their corresponding strengths. Thus,

unlike in the pheromone-based algorithm, there is no shared memory that biases

the choice of each individual of the colony. For problems that involve demand

for finite resources, this kind of approach works particularly well. Like the wasps,

bees do not share a collective memory. They enforce good solutions through direct

communication within a group of individual members of the colony. This way the

exploration of the search space is by nature very efficient and so is the escape from

local minima.

This field of optimization is recent, and the growth ...