The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
An Improved Harmony Search Algorithm with Differential Mutation Operator
Abstract
Harmony Search (HS) is a recently developed stochastic algorithm which imitates the music improvisation process. In this process, the musicians improvise their instrument pitches searching for the perfect state of harmony. Practical experiences, however, suggest that the algorithm suffers from the problems of slow and/or premature convergence over multimodal and rough fitness landscapes. This paper presents an attempt to improve the search performance of HS by hybridizing it with Differential Evolution (DE) algorithm. The performance of the resulting hybrid algorithm has been compared with classical HS, the global best HS, and a very popular variant of DE over a test-suite of six well known benchmark functions and one interesting practical optimization problem. The comparison is based on the following performance indices - (i) accuracy of final result, (ii) computational speed, and (iii) frequency of hitting the optima.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
Cited by
Chaotic harmony search algorithms
Alatas, B. (2010) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.03.114 · Cited by 287
Gaussian Bare-Bones Differential Evolution
Wang, H., Rahnamayan, S., Sun, H., & Omran, M. G. H. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2213808 · Cited by 267
Metadata
- Authors
- Chakraborty, Roy, G. G., Das, S., Jain, D., & Abraham, A.
- Venue
- Fundamenta Informaticae
- Publisher
- SAGE Publications
- Published
- 2009-01
- Volume
- 95
- Issue
- 4
- Pages
- 401-426
- ISSN
- 0169-2968 (ISSN-L)
- 1875-8681
- OpenAlex
- W2159034850
- Cited by
- 164
- References
- 2
- FWCI
- 6.14
- 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: An Improved Harmony Search Algorithm with Differential Mutation Operator. https://app.cochat.ai/papers/10.3233/fi-2009-157
- The paper
- Chakraborty, Roy, G. G., Das, S., Jain, D., & Abraham, A. (2009). An Improved Harmony Search Algorithm with Differential Mutation Operator. Fundamenta Informaticae. https://doi.org/10.3233/fi-2009-157
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.