The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Measuring exploration/exploitation in particle swarms using swarm diversity
Abstract
An important factor contributing to the success of particle swarm optimization (PSO) is the balance between exploration and exploitation of the swarm. Exploration is typically preferred at the initial stages of the search but is required to gradually give way to exploitation of promising solutions as the search progresses. The diversity of a particle swarm optimization algorithm can be defined, simply, as the degree of dispersion of the particles in the swarm. This dispersion could be defined around some center-point or not. It could also be defined based on the positions of the particles or on their velocities. This paper takes a look at some of the different definitions of swarm diversity with the intention of determining their usefulness in quantifying swarm exploration/exploitation. This work is intended to lay the foundations for the development of a suitable means to quantify the rate of change from exploration to exploitation of a PSO, i.e. the rate of change of diversity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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 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
Metadata
- Authors
- Olorunda, O., & Engelbrecht, A. P.
- Venue
- 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 1128-1134
- OpenAlex
- W2110250181
- Cited by
- 307
- References
- 1
- FWCI
- 3.47
- 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.