Process / pipeline

Harmony Search — Music-Inspired Metaheuristic Optimization

Harmony Search (HS) is a population-based metaheuristic optimization algorithm introduced by Geem, Kim, and Loganathan in 2001. It mimics the improvisation process of jazz musicians seeking a perfect state of harmony, using three operators — memory consideration, pitch adjustment, and random selection — to generate candidate solutions. The algorithm applies to both continuous and discrete variables and has found wide use in engineering design, water distribution network optimization, and combinatorial problems.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. Simulation, 76(2), 60–68. DOI: 10.1177/003754970107600201
  2. Mahdavi, M., Fesanghary, M., & Damangir, E. (2007). An Improved Harmony Search Algorithm for Solving Optimization Problems. Applied Mathematics and Computation, 188(2), 1567–1579. DOI: 10.1016/j.amc.2006.11.033

Related methods

Referenced by

ScholarGateHarmony Search (Harmony Search Algorithm). Retrieved 2026-06-04 from https://scholargate.app/en/optimization/harmony-search