The DOI matches its Crossref record.
Particle swarm optimisation with spatial particle extension
Abstract
In this paper, we introduce spatial extension to particles in the PSO model in order to overcome premature convergence in iterative optimisation. The standard PSO and the new model (SEPSO) are compared w.r.t. performance on well-studied benchmark problems. We show that the SEPSO indeed managed to keep diversity in the search space and yielded superior results.
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
Cited by
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
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
Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems
del Valle, Y., Venayagamoorthy, G. K., Mohagheghi, S., Hernandez, J.-C., & Harley, R. G. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.896686 · Cited by 2,277
Clerc, M. (2006) · Wiley eBooks · doi:10.1002/9780470612163 · Cited by 1,622
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
Particle Swarm Optimization Versus Genetic Algorithms for Phased Array Synthesis
Boeringer, D. W., & Werner, D. H. (2004) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2004.825102 · Cited by 945
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
A review of particle swarm optimization. Part I: background and development
Banks, A., Vincent, J., & Anyakoha, C. (2007) · Natural Computing · doi:10.1007/s11047-007-9049-5 · Cited by 626
Multiswarms, exclusion, and anti-convergence in dynamic environments
Blackwell, T., & Branke, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.857074 · Cited by 536
Das, S., Abraham, A., & Konar, A. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-78297-1_1 · Cited by 429
Esmin, A. A. A., Coelho, R. A., & Matwin, S. (2015) · Artificial Intelligence Review · doi:10.1007/s10462-013-9400-4 · Cited by 340
Measuring exploration/exploitation in particle swarms using swarm diversity
Olorunda, O., & Engelbrecht, A. P. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4630938 · Cited by 307
Differential evolution and particle swarm optimisation in partitional clustering
Paterlini, S., & Krink, T. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.12.004 · Cited by 296
Self-citationPerformance assessment of the metaheuristic optimization algorithms: an exhaustive review
Halim, A. H., Ismail, I., & Das, S. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09906-6 · Cited by 293
A review on particle swarm optimization algorithms and their applications to data clustering
Rana, S., Jasola, S., & Kumar, R. (2011) · Artificial Intelligence Review · doi:10.1007/s10462-010-9191-9 · Cited by 271
Metadata
- Authors
- Krink, T., Vesterstrom, J. S., & Riget, J.
- Venue
- Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
- Publisher
- IEEE
- Published
- 2003-06-25
- Volume
- 2
- Pages
- 1474-1479
- OpenAlex
- W1930801851
- Cited by
- 232
- References
- 0
- FWCI
- 8.59
- 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.