The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Dynamic multi-swarm particle swarm optimizer
Abstract
In this paper, a novel dynamic multi-swarm particle swarm optimizer (PSO) is introduced. Different from the existing multi-swarm PSOs and the local version of PSO, the swarms are dynamic and the swarms' size is small. The whole population is divided into many small swarms, these swarms are regrouped frequently by using various regrouping schedules and information is exchanged among the swarms. Experiments are conducted on a set of shifted rotated benchmark functions and results show its better performance when compared with some recent PSO variants.
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
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×
“INTRODCTION Particle swarm optimizer (PSO), introduced by Kennedy and Eberhart in 1995 [1][2], emulates flocking behavior of birds to solve the optimization problems.”
BackgroundA 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
A Cooperative Approach to Particle Swarm Optimization
vandenBergh, F., & Engelbrecht, A. P. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826069 · Cited by 2,120
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
Population structure and particle swarm performance
Kennedy, J., & Mendes, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004493 · Cited by 1,586
Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance
Kennedy, J. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785509 · Cited by 1,061
Multiobjective optimization using dynamic neighborhood particle swarm optimization
Hu, X., & Eberhart, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004494 · Cited by 613
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
Self-citationFitness-distance-ratio based particle swarm optimization
Peram, T., Veeramachaneni, K., & Mohan, C. K. (2004) · Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706) · doi:10.1109/sis.2003.1202264 · Cited by 474
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
Self-citationHybrid Particle Swarm Optimiser with breeding and subpopulations
Løvbjerg, M., Rasmussen, T., & Krink, T. (2001) · Cited by 429
Unified particle swarm optimization for tackling operations research problems
Parsopoulos, K. E., & Vrahatis, M. N. (2005) · IEEE Swarm Intelligence Symposium · doi:10.1109/sis.2005.1501602 · Cited by 51
Cited by
Particle swarm optimization algorithm: An overview
Wang, D., Tan, D., & Liu, L. (2018) · Soft Computing · doi:10.1007/s00500-016-2474-6 · Cited by 3,343
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
Mirjalili, S., & Lewis, A. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2012.09.002 · Cited by 1,099
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
“D functions, the number of swarms varied from 4 to 50, creating an average size around 240; in DMS-PSO [30], a larger swarm size 450 was adopted for the optimization of 500-”
BackgroundMethodInfluentialA 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
“In the experiments on low-dimensional optimization problems, five representative PSO variants have been chosen to compare with the proposed SL-PSO, including the global version PSO (GPSO) [73], the local version PSO (LPSO) [44], the fully informed PSO (FIPS) [53], the dynamic multi-swarm PSO (DMS-PSO) [48] and the com…”
Method
Metadata
- Authors
- Liang, J. J., & Suganthan, P. N.
- Venue
- Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005.
- Publisher
- IEEE
- Published
- 2005-08-30
- Pages
- 124-129
- OpenAlex
- W2138278080
- Cited by
- 486
- References
- 14
- FWCI
- 6.68
- Type
- conference paper
- 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.