The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A New Heuristic Optimization Algorithm: Harmony Search
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Cited by
A New Metaheuristic Bat-Inspired Algorithm
Yang, X.-S. (2010) · Studies in Computational Intelligence · doi:10.1007/978-3-642-12538-6_6 · Cited by 4,905
Lee, K. S., & Geem, Z. W. (2005) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2004.09.007 · Cited by 1,772
Self-citationMetaheuristics—the metaphor exposed
Sörensen, K. (2015) · International Transactions in Operational Research · doi:10.1111/itor.12001 · Cited by 1,051
Atom search optimization and its application to solve a hydrogeologic parameter estimation problem
Zhao, W., Wang, L., & Zhang, Z. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.08.030 · Cited by 699
Crayfish optimization algorithm
Jia, H., Rao, H., Wen, C., & Mirjalili, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10567-4 · Cited by 644
Metadata
- Authors
- Geem, Z. W., Kim, J. H., & Loganathan, G. V.
- Venue
- SIMULATION
- Publisher
- SAGE Publications
- Published
- 2001-02
- Volume
- 76
- Issue
- 2
- Pages
- 60-68
- ISSN
- 0037-5497 (ISSN-L)
- 1741-3133
- OpenAlex
- W1993885071
- Cited by
- 6,247
- References
- 1
- FWCI
- 2.63
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A New Heuristic Optimization Algorithm: Harmony Search. https://app.cochat.ai/papers/10.1177/003754970107600201
- The paper
- Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A New Heuristic Optimization Algorithm: Harmony Search. SIMULATION. https://doi.org/10.1177/003754970107600201
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
