The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Frankenstein's PSO: A Composite Particle Swarm Optimization Algorithm
Abstract
During the last decade, many variants of the original particle swarm optimization (PSO) algorithm have been proposed. In many cases, the difference between two variants can be seen as an algorithmic component being present in one variant but not in the other. In the first part of the paper, we present the results and insights obtained from a detailed empirical study of several PSO variants from a component difference point of view. In the second part of the paper, we propose a new PSO algorithm that combines a number of algorithmic components that showed distinct advantages in the experimental study concerning optimization speed and reliability. We call this composite algorithm Frankenstein's PSO in an analogy to the popular character of Mary Shelley's novel. Frankenstein's PSO performance evaluation shows that by integrating components in novel ways effective optimizers can be designed.
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 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 · cited 1×
“, particle swarm optimization (PSO), run-time distributions, swarm intelligence.”
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
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
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
Comparing inertia weights and constriction factors in particle swarm optimization
Eberhart, R. C., & Shi, Y. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870279 · Cited by 2,966
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
(2005) · Cited by 2,565
Fundamentals of Computational Swarm Intelligence
Engelbrecht, A. P. (2005) · Medical Entomology and Zoology · Cited by 1,871
The Fully Informed Particle Swarm: Simpler, Maybe Better
Mendes, R., Kennedy, J., & Neves, J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826074 · Cited by 1,745
Clerc, M. (2006) · Wiley eBooks · doi:10.1002/9780470612163 · Cited by 1,622
Stochastic Local Search: Foundations & Applications
Hoos, H. H., & St�tzle, T. (2004) · Medical Entomology and Zoology · Cited by 1,227
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
Particle swarm optimiser with neighbourhood operator
Suganthan, P. N. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785514 · Cited by 514
Novel composition test functions for numerical global optimization
Liang, J. J., Suganthan, P. N., & Deb, K. (2005) · Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005. · doi:10.1109/sis.2005.1501604 · Cited by 432
A hierarchical particle swarm optimizer and its adaptive variant
Janson, S., & Middendorf, M. (2005) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2005.850530 · Cited by 373
A hybrid simplex search and particle swarm optimization for unconstrained optimization
Fan, S.-K. S., & Zahara, E. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.034 · Cited by 350
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
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
Neighborhood Re-structuring in Particle Swarm Optimization
Mohais, A. S., Mendes, R., Ward, C., et al. (2005) · Lecture notes in computer science · doi:10.1007/11589990_80 · Cited by 74
Heterogeneous particle swarm optimizers
de, M. A. M., Peña, J., Stützle, T., Pinciroli, C., & Dorigo, M. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4983013 · Cited by 63
Self-citationA Comparison of Particle Swarm Optimization Algorithms Based on Run-Length Distributions
de, M. A. M., Stützle, T., Birattari, M., & Dorigo, M. (2006) · Lecture notes in computer science · doi:10.1007/11839088_1 · Cited by 32
Self-citationSocial interaction in particle swarm optimization, the ranked FIPS, and adaptive multi-swarms
Jordan, J., Helwig, S., & Wanka, R. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389103 · Cited by 28
On the moments of the sampling distribution of particle swarm optimisers
Poli, R. (2007) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/1274000.1274075 · Cited by 22
Cited by
A 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
“For simplicity, the commonly used ring topology[22], [23], [59], which has been shown to be an effective neighborhood structure [60] is adopted here.”
MethodParticle 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
A novel particle swarm optimization algorithm with adaptive inertia weight
Nickabadi, A., Ebadzadeh, M. M., & Safabakhsh, R. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2011.01.037 · Cited by 806
A Self-Learning Particle Swarm Optimizer for Global Optimization Problems
Li, C., Yang, S., & Nguyen, T. T. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2171946 · Cited by 384
Phasor particle swarm optimization: a simple and efficient variant of PSO
Ghasemi, M., Akbari, E., Rahimnejad, A., Razavi, S. E., Ghavidel, S., & Li, L. (2019) · Soft Computing · doi:10.1007/s00500-018-3536-8 · Cited by 278
Metadata
- Authors
- Montes de Oca, M. A., Stutzle, T., Birattari, M., & Dorigo, M.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2009-10
- Volume
- 13
- Issue
- 5
- Pages
- 1120-1132
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W1991248646
- Cited by
- 366
- References
- 28
- FWCI
- 26.02
- 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.