The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
An efficient constraint handling method for genetic algorithms
Deb, K. (2000) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(99)00389-8 · Cited by 3,892
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
Coello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Introduction to Optimum Design
(2004) · Elsevier eBooks · doi:10.1016/b978-0-12-064155-0.x5000-9 · Cited by 2,215
Stochastic ranking for constrained evolutionary optimization
Runarsson, T. P., & Yao, X. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.873238 · Cited by 1,807
Use of a self-adaptive penalty approach for engineering optimization problems
Coello Coello, C. A. (2000) · Computers in Industry · doi:10.1016/s0166-3615(99)00046-9 · Cited by 1,316
Cited by
Slime mould algorithm: A new method for stochastic optimization
Li, S., Chen, H., Wang, M., Heidari, A. A., & Mirjalili, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.03.055 · Cited by 3,036
The Arithmetic Optimization Algorithm
Abualigah, L., Diabat, A., Mirjalili, S., Abd Elaziz, M., & Gandomi, A. H. (2021) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2020.113609 · Cited by 2,928
Askarzadeh, A. (2016) · Computers & Structures · doi:10.1016/j.compstruc.2016.03.001 · Cited by 2,216
Aquila Optimizer: A novel meta-heuristic optimization algorithm
Abualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A. A., Al-qaness, M. A. A., & Gandomi, A. H. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107250 · Cited by 2,213
Abdollahzadeh, B., Gharehchopogh, F. S., & Mirjalili, S. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107408 · Cited by 1,438
Metadata
- Authors
- He, Q., & Wang, L.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2007-03
- Volume
- 186
- Issue
- 2
- Pages
- 1407-1422
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2027382431
- Cited by
- 468
- References
- 21
- FWCI
- 10.33
- 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 hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. https://app.cochat.ai/papers/10.1016/j.amc.2006.07.134
- The paper
- He, Q., & Wang, L. (2007). A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Applied Mathematics and Computation. https://doi.org/10.1016/j.amc.2006.07.134
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.