Harmony Search Algorithm for solving Constraint Satisfaction Problems


In this paper we present a harmony search (HS) algorithm for solving constraint satisfaction and optimization problems. The Harmony search algorithm is an evolutionary algorithm which mimics musicians’ behaviors such as random play, memory-based play, and pitch-adjusted play when they perform improvisation. The major thrust of this algorithm lies in its ability to integrate exploitation and exploration in a parallel optimization environment. This algorithm results are compared with other algorithms using the well known n-queens problem.