The DOI matches its Crossref record.
Composite Particle Swarm Optimizer With Historical Memory for Function Optimization
Abstract
Particle swarm optimization (PSO) algorithm is a population-based stochastic optimization technique. It is characterized by the collaborative search in which each particle is attracted toward the global best position (gbest) in the swarm and its own best position (pbest). However, all of particles' historical promising pbests in PSO are lost except their current pbests. In order to solve this problem, this paper proposes a novel composite PSO algorithm, called historical memory-based PSO (HMPSO), which uses an estimation of distribution algorithm to estimate and preserve the distribution information of particles' historical promising pbests. Each particle has three candidate positions, which are generated from the historical memory, particles' current pbests, and the swarm's gbest. Then the best candidate position is adopted. Experiments on 28 CEC2013 benchmark functions demonstrate the superiority of HMPSO over other algorithms.
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
Cited by
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Gad, A. G. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09694-4 · Cited by 1,869
Cao, Y., Zhang, H., Li, W., Zhou, M., Zhang, Y., & Chaovalitwongse, W. A. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2885075 · Cited by 405
Self-citationKang, Q., Wang, J., Zhou, M., & Ammari, A. C. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2487323 · Cited by 328
Self-citationA 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
Self-citationFlexible Job-Shop Rescheduling for New Job Insertion by Using Discrete Jaya Algorithm
Gao, K., Yang, F., Zhou, M., Pan, Q., & Suganthan, P. N. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2817240 · Cited by 302
Self-citation
Metadata
- Authors
- Li, J., Zhang, J., Jiang, C., & Zhou, M.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2015-10
- Volume
- 45
- Issue
- 10
- Pages
- 2350-2363
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W1545960569
- Cited by
- 173
- References
- 0
- FWCI
- 20.65
- 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: Composite Particle Swarm Optimizer With Historical Memory for Function Optimization. https://app.cochat.ai/papers/10.1109/tcyb.2015.2424836
- The paper
- Li, J., Zhang, J., Jiang, C., & Zhou, M. (2015). Composite Particle Swarm Optimizer With Historical Memory for Function Optimization. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2015.2424836
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.