A new heuristic optimization algorithm

Harmony search

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

Research output: Contribution to journalArticle

3202 Citations (Scopus)

Abstract

Many optimization problems in various fields have been solved using diverse optimization algorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NLP), and dynamic programming (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 algorithms). However, there are still some possibilities of devising new heuristic algorithms based on analogies with natural or artificial phenomena. A new heuristic algorithm, mimicking the improvisation of music players, has been developed 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.

Original languageEnglish
Pages (from-to)60-68
Number of pages9
JournalSimulation
Volume76
Issue number2
Publication statusPublished - 2001 Jun 27

Fingerprint

Harmony Search
Heuristic Optimization
Heuristic algorithm
Optimization Algorithm
Optimization Problem
Tabu Search Algorithm
Network Design
Travelling salesman problems
Music
Nonlinear Programming
Simulated Annealing
Optimization Techniques
Nonlinear Dynamics
Dynamic Programming
Analogy
Evolutionary Algorithms
Linear programming
Heuristic algorithms
Costs
Traveling salesman problem

Keywords

  • Combinatorial optimization
  • Harmony search
  • Heuristic algorithm
  • Music
  • Optimization

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design
  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. Simulation, 76(2), 60-68.

A new heuristic optimization algorithm : Harmony search. / Geem, Zong Woo; Kim, Joong Hoon; Loganathan, G. V.

In: Simulation, Vol. 76, No. 2, 27.06.2001, p. 60-68.

Research output: Contribution to journalArticle

Geem, ZW, Kim, JH & Loganathan, GV 2001, 'A new heuristic optimization algorithm: Harmony search', Simulation, vol. 76, no. 2, pp. 60-68.
Geem ZW, Kim JH, Loganathan GV. A new heuristic optimization algorithm: Harmony search. Simulation. 2001 Jun 27;76(2):60-68.
Geem, Zong Woo ; Kim, Joong Hoon ; Loganathan, G. V. / A new heuristic optimization algorithm : Harmony search. In: Simulation. 2001 ; Vol. 76, No. 2. pp. 60-68.
@article{6bc4b9662bf0460a9008a9d5a84d39e6,
title = "A new heuristic optimization algorithm: Harmony search",
abstract = "Many optimization problems in various fields have been solved using diverse optimization algorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NLP), and dynamic programming (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 algorithms). However, there are still some possibilities of devising new heuristic algorithms based on analogies with natural or artificial phenomena. A new heuristic algorithm, mimicking the improvisation of music players, has been developed 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.",
keywords = "Combinatorial optimization, Harmony search, Heuristic algorithm, Music, Optimization",
author = "Geem, {Zong Woo} and Kim, {Joong Hoon} and Loganathan, {G. V.}",
year = "2001",
month = "6",
day = "27",
language = "English",
volume = "76",
pages = "60--68",
journal = "Simulation",
issn = "0037-5497",
publisher = "SAGE Publications Ltd",
number = "2",

}

TY - JOUR

T1 - A new heuristic optimization algorithm

T2 - Harmony search

AU - Geem, Zong Woo

AU - Kim, Joong Hoon

AU - Loganathan, G. V.

PY - 2001/6/27

Y1 - 2001/6/27

N2 - Many optimization problems in various fields have been solved using diverse optimization algorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NLP), and dynamic programming (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 algorithms). However, there are still some possibilities of devising new heuristic algorithms based on analogies with natural or artificial phenomena. A new heuristic algorithm, mimicking the improvisation of music players, has been developed 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.

AB - Many optimization problems in various fields have been solved using diverse optimization algorithms. Traditional optimization techniques such as linear programming (LP), non-linear programming (NLP), and dynamic programming (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 algorithms). However, there are still some possibilities of devising new heuristic algorithms based on analogies with natural or artificial phenomena. A new heuristic algorithm, mimicking the improvisation of music players, has been developed 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.

KW - Combinatorial optimization

KW - Harmony search

KW - Heuristic algorithm

KW - Music

KW - Optimization

UR - http://www.scopus.com/inward/record.url?scp=0034974417&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034974417&partnerID=8YFLogxK

M3 - Article

VL - 76

SP - 60

EP - 68

JO - Simulation

JF - Simulation

SN - 0037-5497

IS - 2

ER -