Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 252

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Particle swarm optimization with mutation

Stacey, A., Jancic, M., Grundy, I.·2004·The 2003 Congress on Evolutionary Computation, 2003. CEC '03.

Abstract

The particle swarm optimization algorithms converges rapidly during the initial stages of a search, but often slows considerably and can get trapped in local optima. This paper examines the use of mutation to both speed up convergence and escape local minima. It compares the effectiveness of the basic particle swarm optimization scheme (BPSO) with each of BPSO with mutation, constriction particle swarm optimization (CPSO) with mutation, and CPSO without mutation. The four test functions used were the Sphere, Ackley, Rastrigin and Rosenbrock functions of dimensions 10, 20 and 30. The results show that mutation hinders the motion of the swarm on the sphere but the combination of CPSO with mutation provides a significant improvement in performance for the Rastrigin and Rosenbrock functions for all dimensions and the Ackley function for dimensions 20 and 30, with no improvement for the 10 dimensional case.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cec.2003.1299838

Cites

9 of 9 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 9 references

Cited by

See all 252

Metadata

Authors
Stacey, A., Jancic, M., & Grundy, I.
Venue
The 2003 Congress on Evolutionary Computation, 2003. CEC '03.
Publisher
IEEE
Published
2004-07-09
Volume
2
Pages
1425-1430
OpenAlex
W1545730907
Cited by
252
References
9
FWCI
6.72
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Particle swarm optimization with mutation. https://app.cochat.ai/papers/10.1109/cec.2003.1299838
The paper
Stacey, A., Jancic, M., & Grundy, I. (2004). Particle swarm optimization with mutation. The 2003 Congress on Evolutionary Computation, 2003. CEC '03. https://doi.org/10.1109/cec.2003.1299838

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.