A New Heuristic Optimization Algorithm: Harmony Search

  • Zong Woo Geem
    Department of Civil and Environmental Engineering Korea University, Seoul, South Korea 136-701
  • Joong Hoon Kim
    Department of Civil and Environmental Engineering Korea University, Seoul, South Korea 136-701
  • G.V. Loganathan
    Department of Civil and Environmental Engineering Virginia Polytechnic Institute and State University Blacksburg, Virginia 24061

書誌事項

公開日
2001-02
権利情報
  • https://journals.sagepub.com/page/policies/text-and-data-mining-license
DOI
  • 10.1177/003754970107600201
公開者
SAGE Publications

この論文をさがす

説明

<jats:p> 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. </jats:p>

収録刊行物

  • SIMULATION

    SIMULATION 76 (2), 60-68, 2001-02

    SAGE Publications

被引用文献 (12)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ