The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A novel binary particle swarm optimization
Abstract
Particle swarm optimization (PSO) as a novel computational intelligence technique, has succeeded in many continuous problems. But in discrete or binary version there are still some difficulties. In this paper a novel binary PSO is proposed. This algorithm proposes a new definition for the velocity vector of binary PSO. It will be shown that this algorithm is a better interpretation of continuous PSO into discrete PSO than the older versions. Also a number of benchmark optimization problems are solved using this concept and quite satisfactory results are obtained.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
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
A discrete binary version of the particle swarm algorithm
Kennedy, J., & Eberhart, R. C. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.637339 · Cited by 4,767
Fundamentals of Computational Swarm Intelligence
Engelbrecht, A. P. (2005) · Medical Entomology and Zoology · Cited by 1,871
Fuzzy discrete particle swarm optimization for solving traveling salesman problem
Pang, W., Wang, K., Zhou, C., & Dong, L.-J. (2004) · IEEE International Conference on Computer and Information Technology (CIT) · doi:10.1109/cit.2004.1357292 · Cited by 161
Combining Particle Swarm Optimisation with angle modulation to solve binary problems
Pamparà, G., Franken, N., & Engelbrecht, A. P. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2005.1554671 · Cited by 131
Particle Swarm Optimization Approaches to Coevolve Strategies for the Iterated Prisoner's Dilemma
Franken, N., & Engelbrecht, A. P. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.856202 · Cited by 120
Using PSO Algorithm to Evolve an Optimum Input Subset for a SVM in Time Series Forecasting
Zhang, C., & Hu, H. P. (2006) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2005.1571737 · Cited by 30
Learning Bayesian Network Structures with Discrete Particle Swarm Optimization Algorithm
Heng, X., Qin, Z., Tian, L., & Li-Ping, S. (2007) · IEEE Symposium on Foundations of Computational Intelligence (FOCI) · doi:10.1109/foci.2007.372146 · Cited by 23
Cited by
Xue, B., Zhang, M., & Browne, W. N. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2013.09.018 · Cited by 614
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
Eren, Y., Küçükdemiral, İ. B., & Üstoğlu, İ. (2017) · Optimization in Renewable Energy Systems · doi:10.1016/b978-0-08-101041-9.00002-8 · Cited by 67
Metadata
- Authors
- Khanesar, M. A., Teshnehlab, M., & Shoorehdeli, M. A.
- Venue
- 2007 Mediterranean Conference on Control & Automation
- Publisher
- IEEE
- Published
- 2007-06
- Pages
- 1-6
- ISSN
- 2325-369X (ISSN-L)
- OpenAlex
- W2081423733
- Cited by
- 364
- References
- 9
- FWCI
- 6.72
- Type
- conference paper
- 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 novel binary particle swarm optimization. https://app.cochat.ai/papers/10.1109/med.2007.4433821
- The paper
- Khanesar, M. A., Teshnehlab, M., & Shoorehdeli, M. A. (2007). A novel binary particle swarm optimization. 2007 Mediterranean Conference on Control & Automation. https://doi.org/10.1109/med.2007.4433821
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.