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

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

An effective use of crowding distance in multiobjective particle swarm optimization

Raquel, Carlo R., Naval, Prospero C.·2005·Proceedings of the 7th annual conference on Genetic and evolutionary computation

Abstract

In this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective optimization problems by incorporating the mechanism of crowding distance computation into the algorithm of PSO, specifically on global best selection and in the deletion method of an external archive of nondominated solutions. The crowding distance mechanism together with a mutation operator maintains the diversity of nondominated solutions in the external archive. The performance of this approach is evaluated on test functions and metrics from literature. The results show that the proposed approach is highly competitive in converging towards the Pareto front and generates a well distributed set of nondominated solutions.

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.1145/1068009.1068047

Cites

18 of 18 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 18 references

Cited by

See all 623

Metadata

Authors
Raquel, C. R., & Naval, P. C.
Venue
Proceedings of the 7th annual conference on Genetic and evolutionary computation
Publisher
ACM
Published
2005-06-25
Pages
257-264
OpenAlex
W2123541507
Cited by
623
References
18
FWCI
5.31
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: An effective use of crowding distance in multiobjective particle swarm optimization. https://app.cochat.ai/papers/10.1145/1068009.1068047
The paper
Raquel, C. R., & Naval, P. C. (2005). An effective use of crowding distance in multiobjective particle swarm optimization. Proceedings of the 7th annual conference on Genetic and evolutionary computation. https://doi.org/10.1145/1068009.1068047

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.