A taxonomy of cooperative search algorithms

  • Authors:
  • Mohammed El-Abd;Mohamed Kamel

  • Affiliations:
  • Dept. of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada;Dept. of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada

  • Venue:
  • HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

A lot of heuristic approaches have been explored in the last two decades in order to tackle large size optimization problems. These areas include parallel meta-heuristics, hybrid meta-heuristic, and cooperative search algorithms. Different taxonomies have been proposed in the literature for parallel and hybrid meta-heuristics. In these taxonomies, one can realize that cooperative search algorithms lie somewhere in between. This paper looks at cooperative search algorithms as a stand alone area. Two different taxonomies of cooperative search algorithm are proposed based on two different criteria. Different implementations in this area are reported and classified using these taxonomies.