The variants of the harmony search algorithm: an overview

  • Authors:
  • Osama Moh'D Alia;Rajeswari Mandava

  • Affiliations:
  • Computer Vision Research Group, School of Computer Sciences, University Sains Malaysia, Penang, Malaysia 11800 USM;Computer Vision Research Group, School of Computer Sciences, University Sains Malaysia, Penang, Malaysia 11800 USM

  • Venue:
  • Artificial Intelligence Review
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The harmony search (HS) algorithm is a relatively new population-based metaheuristic optimization algorithm. It imitates the music improvisation process where musicians improvise their instruments' pitch by searching for a perfect state of harmony. Since the emergence of this algorithm in 2001, it attracted many researchers from various fields especially those working on solving optimization problems. Consequently, this algorithm guided researchers to improve on its performance to be in line with the requirements of the applications being developed. These improvements primarily cover two aspects: (1) improvements in terms of parameters setting, and (2) improvements in terms of hybridizing HS components with other metaheuristic algorithms. This paper presents an overview of these aspects, with a goal of providing useful references to fundamental concepts accessible to the broad community of optimization practitioners.