Skip to content

A New Heuristic Optimization Algorithm: Harmony Search

Zong Woo Geem, Joong Hoon Kim, G. V. Loganathan

SIMULATION · 2001 · 6,319 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. SIMULATION, 76(2), 60–68. https://doi.org/10.1177/003754970107600201

In text: (Geem et al., 2001)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

Many optimization problems in various fields have been solved using diverse optimization al gorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NLP), and dynamic program ming (DP) have had major roles in solving these problems. However, their drawbacks generate demand for other types of algorithms, such as heuristic optimization approaches (simulated annealing, tabu search, and evolutionary algo rithms). However, there are still some possibili ties of devising new heuristic algorithms based on analogies with natural or artificial phenom ena. A new heuristic algorithm, mimicking the improvisation of music players, has been devel oped and named Harmony Search (HS). The performance of the algorithm is illustrated with a traveling salesman problem (TSP), a specific academic optimization problem, and a least-cost pipe network design problem.

  1. A fast and elitist multiobjective genetic algorithm: NSGA-II2002
  2. Particle swarm optimization2002
  3. Optimization by Simulated Annealing1983
  4. Statistical Learning Theory1999
  5. A new optimizer using particle swarm theory2002

Metadata from OpenAlex (CC0). Citations are generated from the published record.