Cited by 14,979Metaheuristic Optimization Algorithms ResearchModular Robots and Swarm IntelligenceDistributed Control Multi-Agent Systems

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

Abstract

The optimization of nonlinear functions using particle swarm methodology is described. Implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm. Benchmark testing of both paradigms is described, and applications, including neural network training and robot task learning, are proposed. Relationships between particle swarm optimization and both artificial life and evolutionary computation are reviewed.

Integrity signals

Registry

Crossref · 10.1109/mhs.1995.494215

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. heppner, 1990, The Ubiquity of Chaos
  2. millonas, 1994, Artificial Life III

Cited by

Sorted by citations

Authors
Eberhart, R., & Kennedy, J.
Affiliations
  • Purdue University in Indianapolis (US)
  • Bureau of Labor Statistics (US)
Venue
MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science
Publisher
IEEE
Published
2002-11-19
Pages
39-43
OpenAlex
W2109364787
Cited by
14,979
References
11
Citations by year
2026: 263 · 2025: 461 · 2024: 578 · 2023: 598 · 2022: 625 · 2021: 1047 · 2020: 1048 · 2019: 1038 · 2018: 1069 · 2017: 955 · 2016: 876 · 2015: 841 · 2014: 794 · 2013: 688 · 2012: 688
FWCI
72.81
Type
conference paper
Language
en
Open access
closed
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Engineering › Mechanical Engineering › Modular Robots and Swarm Intelligence
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Control Multi-Agent Systems
Keywords
particle swarm optimization, nonlinear programming, neural network training, robot task learning, artificial life, evolutionary computation, benchmark tests

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