The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Fitness-distance-ratio based particle swarm optimization
Abstract
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. The proposed new algorithm moves particles towards nearby particles of higher fitness, instead of attracting each particle towards just the best position discovered so far by any particle. This is accomplished by using the ratio of the relative fitness and the distance of other particles to determine the direction in which each component of the particle position needs to be changed. The resulting algorithm (FDR-PSO) is shown to perform significantly better than the original PSO algorithm and some of its variants, on many different benchmark optimization problems. Empirical examination of the evolution of the particles demonstrates that the convergence of the algorithm does not occur at an early phase of particle evolution, unlike PSO. Avoiding premature convergence allows FDR-PSO to continue search for global optima in difficult multimodal optimization problems.
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
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
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
Comparison between genetic algorithms and particle swarm optimization
Eberhart, R. C., & Shi, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040812 · Cited by 1,610
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,125
Hybrid Particle Swarm Optimiser with breeding and subpopulations
Løvbjerg, M., Rasmussen, T., & Krink, T. (2001) · Cited by 429
Cooperative learning in neural networks using particle swarm optimizers
van den Bergh, F., & Engelbrecht, A. P. (2000) · Cited by 320
Dissipative particle swarm optimization
Xie, X.-F., Zhang, W.-J., & Yang, Z.-L. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004457 · Cited by 269
Extending particle swarm optimisers with self-organized criticality
Løvbjerg, M., & Krink, T. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2002.1004479 · Cited by 179
Effects of swarm size on Cooperative Particle Swarm Optimisers
van den Bergh, F., & Engelbrecht, A. P. (2001) · Cited by 84
Hybrid particle swarm optimizer with mass extinction
Xie, X., Zhang, W.-J., & Yang, Z.-L. (2003) · International Conference on Communications, Circuits and Systems · doi:10.1109/icccas.2002.1178992 · Cited by 71
Cited by
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
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857610 · Cited by 3,743
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
Particle Swarm Optimization: A Comprehensive Survey
Shami, T. M., El-Saleh, A. A., Alswaitti, M., Al-Tashi, Q., Summakieh, M. A., & Mirjalili, S. (2022) · IEEE Access · doi:10.1109/access.2022.3142859 · Cited by 1,584
Orthogonal Learning Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Shi, Y.-H. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2052054 · Cited by 725
Metadata
- Authors
- Peram, T., Veeramachaneni, K., & Mohan, C. K.
- Venue
- Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706)
- Publisher
- IEEE
- Published
- 2004-03-22
- Pages
- 174-181
- OpenAlex
- W2119649579
- Cited by
- 474
- References
- 13
- FWCI
- 11.06
- 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.