The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Chaos embedded particle swarm optimization algorithms
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. (2002) · 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360) · doi:10.1109/icec.1998.699146 · Cited by 10,229
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001
Empirical study of particle swarm optimization
Shi, Y., & Eberhart, R. C. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785511 · Cited by 3,945
Parameter selection in particle swarm optimization
Shi, Y., & Eberhart, R. C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040810 · Cited by 3,538
Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients
Ratnaweera, A., Halgamuge, S. K., & Watson, H. C. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826071 · Cited by 3,034
The particle swarm optimization algorithm: convergence analysis and parameter selection
Trelea, I. C. (2003) · Information Processing Letters · doi:10.1016/s0020-0190(02)00447-7 · Cited by 2,644
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
Fuzzy adaptive particle swarm optimization
Shi, Y., & Eberhart, R. C. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934377 · Cited by 1,071
Tracking and optimizing dynamic systems with particle swarms
Eberhart, R. C., & Shi, Y. (2002) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934376 · Cited by 1,013
Improved particle swarm optimization combined with chaos
Liu, B., Wang, L., Jin, Y.-H., Tang, F., & Huang, D.-X. (2005) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2004.11.095 · Cited by 947
Chaotic 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
Deterministic Chaos: An Introduction
Schuster, H. G., & Just, W. (2005) · Wiley eBooks · doi:10.1002/3527604804 · Cited by 517
A new chaotic algorithm for image encryption
Gao, H., Zhang, Y., Liang, S., & Li, D. (2006) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2005.08.110 · Cited by 512
A chaotic direct-sequence spread-spectrum communication system
Heidari-Bateni, G., & McGillem, C. D. (1994) · IEEE Transactions on Communications · doi:10.1109/tcomm.1994.582834 · Cited by 498
Generalized descent for global optimization
Griewank, A. (1981) · Journal of Optimization Theory and Applications · doi:10.1007/bf00933356 · Cited by 381
The simplest case of a strange attractor
Zaslavsky, G. M. (1978) · Physics Letters A · doi:10.1016/0375-9601(78)90195-0 · Cited by 280
A dynamic inertia weight particle swarm optimization algorithm
Jiao, B., Lian, Z., & Gu, X. (2008) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2006.09.063 · Cited by 272
On the convergence analysis and parameter selection in particle swarm optimization
Zheng, Y.-L., Ma, L.-H., Zhang, L.-Y., & Qian, J.-X. (2004) · Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693) · doi:10.1109/icmlc.2003.1259789 · Cited by 235
A quantum particle swarm optimizer with chaotic mutation operator
Coelho, L. D. S. (2008) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2006.10.028 · Cited by 216
Chuanwen, J., & Bompard, E. (2005) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2004.10.003 · Cited by 191
Coelho, L. D. S., & Mariani, V. C. (2009) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2007.01.093 · Cited by 175
Lian, Z., Gu, X., & Jiao, B. (2006) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2006.05.082 · Cited by 165
Empirical study of particle swarm optimizer with an increasing inertia weight
Zheng, Y., Ma, L., Zhang, L., & Qian, J. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2003.1299578 · Cited by 145
Arumugam, M. S., & Rao, M. V. C. (2006) · Discrete Dynamics in Nature and Society · doi:10.1155/ddns/2006/79295 · Cited by 80
A New Approach to Improve Particle Swarm Optimization
Zhang, L., Yu, H., & Hu, S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45105-6_12 · Cited by 79
Proceedings of the 1998 IEEE International Conference on Evolutionary Computation [Book Review]
Kennedy, J. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.1999.771169 · Cited by 77
A More Secure Chaotic Cryptographic Scheme Based on the Dynamic Look-Up Table
Wong, K., Man, K.-P., Li, S., & Liao, X. (2005) · Circuits Systems and Signal Processing · doi:10.1007/s00034-005-2408-5 · Cited by 53
Manganaro, G., & de Gyvez, J. P. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1997.592306 · Cited by 39
Chaotic Sequences for Secure CDMAPreprint
Suneel, M. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.nlin/0602018 · Cited by 25
Cited by
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
Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review
Bonyadi, M. R., & Michalewicz, Z. (2017) · Evolutionary Computation · doi:10.1162/evco_r_00180 · Cited by 841
Image encryption using DNA complementary rule and chaotic maps
Liu, H., Wang, X., & kadir, A. (2012) · Applied Soft Computing · doi:10.1016/j.asoc.2012.01.016 · Cited by 626
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-citationACROA: 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-citation
Metadata
- Authors
- Alatas, B., Akin, E., & Ozer, A. B.
- Venue
- Chaos, Solitons & Fractals
- Publisher
- Elsevier BV
- Published
- 2009-05
- Volume
- 40
- Issue
- 4
- Pages
- 1715-1734
- ISSN
- 0960-0779 (ISSN-L)
- OpenAlex
- W2077338021
- Cited by
- 523
- References
- 31
- FWCI
- 32.86
- 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.