The DOI matches its Crossref record.
Modified binary particle swarm optimization
Open accessAbstract
This paper presents a modified binary particle swarm optimization (BPSO) which adopts concepts of the genotype–phenotype representation and the mutation operator of genetic algorithms. Its main feature is that the BPSO can be treated as a continuous PSO. The proposed BPSO algorithm is tested on various benchmark functions, and its performance is compared with that of the original BPSO. Experimental results show that the modified BPSO outperforms the original BPSO algorithm.
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: An overview
Wang, D., Tan, D., & Liu, L. (2018) · Soft Computing · doi:10.1007/s00500-016-2474-6 · Cited by 3,343
Particle Swarm Optimization: A Comprehensive Survey
Shami, T. M., El-Saleh, A. A., Alswaitti, M., Al-Tashi, Q., Summakieh, M. A., & Mirjalili, S. (2022) · IEEE Access · doi:10.1109/access.2022.3142859 · Cited by 1,584
S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
Mirjalili, S., & Lewis, A. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2012.09.002 · Cited by 1,099
Swarm Intelligence Algorithms for Feature Selection: A Review
Brezočnik, L., Fister, I., & Podgorelec, V. (2018) · Applied Sciences · doi:10.3390/app8091521 · Cited by 374
Vieira, S. M., Mendonça, L. F., Farinha, G. J., & Sousa, J. M. C. (2013) · Applied Soft Computing · doi:10.1016/j.asoc.2013.03.021 · Cited by 292
Metadata
- Authors
- Lee, S., Soak, S., Oh, S., Pedrycz, W., & Jeon, M.
- Venue
- Progress in Natural Science
- Publisher
- Elsevier BV
- Published
- 2008-09
- Volume
- 18
- Issue
- 9
- Pages
- 1161-1166
- ISSN
- 1002-0071 (ISSN-L)
- OpenAlex
- W2031366169
- Cited by
- 187
- References
- 0
- FWCI
- 10.07
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Modified binary particle swarm optimization. https://app.cochat.ai/papers/10.1016/j.pnsc.2008.03.018
- The paper
- Lee, S., Soak, S., Oh, S., Pedrycz, W., & Jeon, M. (2008). Modified binary particle swarm optimization. Progress in Natural Science. https://doi.org/10.1016/j.pnsc.2008.03.018
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.