CoChat

A New Particle Swarm Optimization Method Enhanced With a Periodic Mutation Strategy and Neural Networks

Pehlivanoglu, Y. Volkan · 2013 · IEEE Transactions on Evolutionary Computation
Cited by 136

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

Abstract

Particle swarm optimization (PSO), a relatively new population-based intelligence algorithm, exhibits good performance on optimization problems. However, during the optimization process, the particles become more and more similar, and gather into the neighborhood of the best particle in the swarm, which makes the swarm prematurely converged most likely around the local solution. A new optimization algorithm called multifrequency vibrational PSO is significantly improved and tested for two different test cases: optimization of six different benchmark test functions and direct shape optimization of an airfoil in transonic flow. The algorithm emphasizes a new mutation application strategy and diversity variety, such as global random diversity and local controlled diversity. The results offer insight into how the mutation operator affects the nature of the diversity and objective function value. The local controlled diversity is based on an artificial neural network. As far as both the demonstration cases' problems are considered, remarkable reductions in the computational times have been accomplished.

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.

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

Integrity signals

Registry

Crossref · 10.1109/tevc.2012.2196047

Cites

1 of 1 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.

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.

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

Cited by

See all 136

Metadata

Authors
Pehlivanoglu, Y. V.
Venue
IEEE Transactions on Evolutionary Computation
Published
2013-06
Volume
17
Issue
3
Pages
436-452
ISSN
  • 1089-778X (ISSN-L)
  • 1941-0026
OpenAlex
W2138727729
Cited by
136
References
1
FWCI
9.50
Type
journal article
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.