A New Particle Swarm Optimization Method Enhanced With a Periodic Mutation Strategy and Neural Networks
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.
Integrity signals
Registry
Cites
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.
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
“Other hybrid PSO variants include PSO with Gaussian mutation [34], PSO with chaos [35], orthogonal learning PSO (OLPSO) [36], PSO with a moderate-random-search strategy [37], and a very recently proposed PSO with a periodic mutation strategy and neural networks [38].”
BackgroundArtificial Neural Networks Based Optimization Techniques: A Review
Abdolrasol, M. G. M., Hussain, S. M. S., Ustun, T. S., Sarker, M. R., Hannan, M. A., Mohamed, R., Ali, J. A., Mekhilef, S., & Milad, A. (2021) · Electronics · doi:10.3390/electronics10212689 · Cited by 756
A social learning particle swarm optimization algorithm for scalable optimization
Cheng, R., & Jin, Y. (2015) · Information Sciences · doi:10.1016/j.ins.2014.08.039 · Cited by 747
“Other specific search operators have also been incorporated into PSO, including mutation operators [29,51,61], local search operators [83,86], and some nature-inspired operators as well, such as the niching PSO [5], culture-based PSO [13] and the aging theory inspired PSO (ALC-PSO) [8].”
BackgroundPopulation size in Particle Swarm Optimization
Piotrowski, A. P., Napiorkowski, J. J., & Piotrowska, A. E. (2020) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2020.100718 · Cited by 357
A Level-Based Learning Swarm Optimizer for Large-Scale Optimization
Yang, Q., Chen, W.-N., Deng, J. D., Li, Y., Gu, T., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2743016 · Cited by 326
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A New Particle Swarm Optimization Method Enhanced With a Periodic Mutation Strategy and Neural Networks. https://app.cochat.ai/papers/10.1109/tevc.2012.2196047
- The paper
- Pehlivanoglu, Y. V. (2013). A New Particle Swarm Optimization Method Enhanced With a Periodic Mutation Strategy and Neural Networks. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2012.2196047
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.