Chaotic harmony search algorithms
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Harmony Search (HS) is one of the newest and the easiest to code music inspired heuristics for optimization problems. Like the use of chaos in adjusting note parameters such as pitch, dynamic, rhythm, duration, tempo, instrument selection, attack time, etc. in real music and in sound synthesis and timbre construction, this paper proposes new HS algorithms that use chaotic maps for parameter adaptation in order to improve the convergence characteristics and to prevent the HS to get stuck on local solutions. This has been done by using of chaotic number generators each time a random number is needed by the classical HS algorithm. Seven new chaotic HS algorithms have been proposed and different chaotic maps have been analyzed in the benchmark functions. It has been detected that coupling emergent results in different areas, like those of HS and complex dynamics, can improve the quality of results in some optimization problems. It has been also shown that, some of the proposed methods have somewhat increased the solution quality, that is in some cases they improved the global searching capability by escaping the local solutions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001 · cited 2×
“(6), has been brought to the attention of scientists by Sir Robert May in 1976 [32].”
BackgroundMethodA New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
Chaos and Fractals: New Frontiers of Science
Peitgen, H.-O., Jürgens, H., & Saupe, D. (1992) · Springer eBooks · doi:10.1007/978-1-4757-4740-9 · Cited by 1,977
An improved harmony search algorithm for solving optimization problems
Mahdavi, M., Fesanghary, M., & Damangir, E. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.11.033 · Cited by 1,863
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
Omran, M. G. H., & Mahdavi, M. (2008) · Applied Mathematics and Computation · doi:10.1016/j.amc.2007.09.004 · Cited by 753
Deterministic Chaos: An Introduction
Knight, P. L. (1988) · Journal of Modern Optics · doi:10.1080/09500348814551201 · Cited by 687
Chaotic bee colony algorithms for global numerical optimization
Alatas, B. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.02.042 · Cited by 551
Self-citationChaos embedded particle swarm optimization algorithms
Alatas, B., Akin, E., & Ozer, A. B. (2009) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2007.09.063 · Cited by 523
Self-citationChaotic sequences to improve the performance of evolutionary algorithms
Caponetto, R., Fortuna, L., Fazzino, S., & Xibilia, M. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810069 · Cited by 519
Cited by
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Gandomi, A. H., Yang, X.-S., Talatahari, S., & Alavi, A. H. (2013) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2012.06.009 · Cited by 857
Metaheuristic Algorithms: A Comprehensive Review
Abdel-Basset, M., Abdel-Fatah, L., & Sangaiah, A. K. (2018) · Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications · doi:10.1016/b978-0-12-813314-9.00010-4 · Cited by 637
Chaotic whale optimization algorithm
Kaur, G., & Arora, S. (2018) · Journal of Computational Design and Engineering · doi:10.1016/j.jcde.2017.12.006 · Cited by 533
Gandomi, A. H., & Yang, X.-S. (2014) · Journal of Computational Science · doi:10.1016/j.jocs.2013.10.002 · Cited by 508
ACROA: Artificial Chemical Reaction Optimization Algorithm for global optimization
Alatas, B. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2011.04.126 · Cited by 420
Self-citationChaos-enhanced accelerated particle swarm optimization
Gandomi, A. H., Yun, G. J., Yang, X.-S., & Talatahari, S. (2013) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2012.07.017 · Cited by 396
A survey on applications of the harmony search algorithm
Manjarres, D., Landa-Torres, I., Gil-Lopez, S., Del Ser, J., Bilbao, M. N., Salcedo-Sanz, S., & Geem, Z. W. (2013) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2013.05.008 · Cited by 363
Chaos Game Optimization: a novel metaheuristic algorithm
Talatahari, S., & Azizi, M. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09867-w · Cited by 338
Chaotic gravitational constants for the gravitational search algorithm
Mirjalili, S., & Gandomi, A. H. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.01.008 · Cited by 294
Imperialist competitive algorithm combined with chaos for global optimization
Talatahari, S., Farahmand Azar, B., Sheikholeslami, R., & Gandomi, A. H. (2012) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2011.08.021 · Cited by 260
Metadata
- Authors
- Alatas, B.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2010-07
- Volume
- 216
- Issue
- 9
- Pages
- 2687-2699
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2149236946
- Cited by
- 287
- References
- 21
- FWCI
- 14.62
- Type
- journal article
- Language
- en
- Open access
- green
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
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.