Improved particle swarm optimization combined with chaos
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Synchronization in chaotic systems
Pecora, L. M., & Carroll, T. L. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.821 · Cited by 10,625
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 · cited 1×
“In this paper, the well-known logistic equation [15], which exhibits the sensitive dependence on initial conditions, is employed for constructing hybrid PSO.”
MethodOtt, E., Grebogi, C., & Yorke, J. A. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.1196 · Cited by 5,431
Particle swarm optimization: developments, applications and resources
Eberhart, & Shi, Y. (2001) · Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546) · doi:10.1109/cec.2001.934374 · Cited by 4,310
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
Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences
Angeline, P. J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0040811 · Cited by 1,230
Aihara, K., Takabe, T., & Toyoda, M. (1990) · Physics Letters A · doi:10.1016/0375-9601(90)90136-c · Cited by 1,175
(2009) · Encyclopedia of Neuroscience · doi:10.1007/978-3-540-29678-2_965 · Cited by 926
Global optimization and simulated annealing
Dekkers, A., & Aarts, E. (1991) · Mathematical Programming · doi:10.1007/bf01594945 · Cited by 435
Porto, V. W., Eiben, A. E., Waagen, D., & Saravanan, N. (1998) · Lecture notes in computer science · doi:10.1007/bfb0040753 · Cited by 430
Taboo Search: An Approach to the Multiple Minima Problem
Cvijović, D., & Klinowski, J. (1995) · Science · doi:10.1126/science.267.5198.664 · Cited by 416
OPTIMIZING COMPLEX FUNCTIONS BY CHAOS SEARCH
Jiang, B. (1998) · Cybernetics & Systems · doi:10.1080/019697298125678 · Cited by 225
Application of chaos in simulated annealing
Ji, M., & Huanwen, T. (2004) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2003.12.032 · Cited by 212
Continuous control and synchronization in chaotic systems
Kapitaniak, T. (1995) · Chaos Solitons & Fractals · doi:10.1016/0960-0779(95)80030-k · Cited by 107
On robust control of uncertain chaotic systems: a sliding-mode synthesis via chaotic optimization
Lu, Z., Shieh, L., & Chen, G. (2003) · Chaos Solitons & Fractals · doi:10.1016/s0960-0779(03)00033-x · Cited by 51
Cited by
Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications
Zhao, W., Zhang, Z., & Wang, L. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2019.103300 · Cited by 1,080
Self-citationA Competitive Swarm Optimizer for Large Scale Optimization
Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2322602 · Cited by 1,052
“Other hybrid PSO variants include PSO with Gaussian mutation [34], PSO with chaos [35], orthogonal learning PSO (OLPSO) [36], PSO with a moderate-random-search strategy [37], and a very recently proposed PSO with a periodic mutation strategy and neural networks [38].”
BackgroundSelf-citationA social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
“Other specific search operators have also been incorporated into PSO, including mutation operators [29,51,61], local search operators [83,86], and some nature-inspired operators as well, such as the niching PSO [5], culture-based PSO [13] and the aging theory inspired PSO (ALC-PSO) [8].”
BackgroundSelf-citationMoghaddam, A. A., Seifi, A., Niknam, T., & Alizadeh Pahlavani, M. R. (2011) · Energy · doi:10.1016/j.energy.2011.09.017 · Cited by 630
Bio inspired computing – A review of algorithms and scope of applications
Kar, A. K. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.04.018 · Cited by 578
Metadata
- Authors
- Liu, B., Wang, L., Jin, Y.-H., Tang, F., & Huang, D.-X.
- Venue
- Chaos, Solitons & Fractals
- Publisher
- Elsevier BV
- Published
- 2005-09
- Volume
- 25
- Issue
- 5
- Pages
- 1261-1271
- ISSN
- 0960-0779 (ISSN-L)
- OpenAlex
- W1994867044
- Cited by
- 947
- References
- 19
- FWCI
- 30.92
- 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.