The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Imperialist competitive algorithm combined with chaos for global optimization
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
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Synchronization in chaotic systems
Pecora, L. M., & Carroll, T. L. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.821 · Cited by 10,625
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001
A 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
Ott, E., Grebogi, C., & Yorke, J. A. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.1196 · Cited by 5,431
Ott, E., & Wiesenfeld, K. (1994) · Physics Today · doi:10.1063/1.2808369 · Cited by 3,448
Atashpaz-Gargari, E., & Lucas, C. (2007) · 2007 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2007.4425083 · Cited by 2,628
Ott, E. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511803260 · Cited by 2,298
A novel heuristic optimization method: charged system search
Kaveh, A., & Talatahari, S. (2010) · Acta Mechanica · doi:10.1007/s00707-009-0270-4 · Cited by 1,354
Self-citationChaotic 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
Chaos 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
On the efficiency of chaos optimization algorithms for global optimization
Yang, D., Li, G., & Cheng, G. (2007) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2006.04.057 · Cited by 414
Optimum design of skeletal structures using imperialist competitive algorithm
Kaveh, A., & Talatahari, S. (2010) · Computers & Structures · doi:10.1016/j.compstruc.2010.06.011 · Cited by 288
Self-citationChaotic harmony search algorithms
Alatas, B. (2010) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.03.114 · Cited by 287
Atashpaz-Gargari, E., Hashemzadeh, F., Rajabioun, R., & Lucas, C. (2008) · International Journal of Intelligent Computing and Cybernetics · doi:10.1108/17563780810893446 · Cited by 255
Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization
Coelho, L. D. S., & Mariani, V. C. (2007) · Expert Systems with Applications · doi:10.1016/j.eswa.2007.02.002 · Cited by 252
Chaotic characteristics of a one-dimensional iterative map with infinite collapses
He, D., He, C., Jiang, L.-G., Zhu, H.-W., & Hu, G.-R. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.933333 · Cited by 210
Does chaos work better than noise?
Bucolo, M., Caponetto, R., Fortuna, L., Frasca, M., & Rizzo, A. (2002) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2002.1167624 · Cited by 170
An optimization algorithm based on chaotic behavior and fractal nature
Tavazoei, M. S., & Haeri, ء. (2006) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2006.09.008 · Cited by 88
He, Y., Zhou, J., Xiang, X., Chen, H., & Qin, H. (2009) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2009.04.019 · Cited by 77
IMPERIALIST COMPETITIVE ALGORITHM FOR ENGINEERING DESIGN PROBLEMS
Kaveh, A., & Talatahari, S. (2010) · Cited by 41
Self-citation
Cited by
Gandomi, A. H., & Yang, X.-S. (2014) · Journal of Computational Science · doi:10.1016/j.jocs.2013.10.002 · Cited by 508
Self-citationChaotic 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
Self-citation
Metadata
- Authors
- Talatahari, S., Farahmand Azar, B., Sheikholeslami, R., & Gandomi, A. H.
- Venue
- Communications in Nonlinear Science and Numerical Simulation
- Publisher
- Elsevier BV
- Published
- 2012-03
- Volume
- 17
- Issue
- 3
- Pages
- 1312-1319
- ISSN
- 1007-5704 (ISSN-L)
- OpenAlex
- W2029254187
- Cited by
- 260
- References
- 22
- FWCI
- 17.74
- 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
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.