The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Real-Coded Chemical Reaction Optimization
Abstract
Optimization problems can generally be classified as continuous and discrete, based on the nature of the solution space. A recently developed chemical-reaction-inspired metaheuristic, called chemical reaction optimization (CRO), has been shown to perform well in many optimization problems in the discrete domain. This paper is dedicated to proposing a real-coded version of CRO, namely, RCCRO, to solve continuous optimization problems. We compare the performance of RCCRO with a large number of optimization techniques on a large set of standard continuous benchmark functions. We find that RCCRO outperforms all the others on the average. We also propose an adaptive scheme for RCCRO which can improve the performance effectively. This shows that CRO is suitable for solving problems in the continuous domain.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Cited by
Metaheuristic Algorithms: A Comprehensive Review
Abdel-Basset, M., Abdel-Fatah, L., & Sangaiah, A. K. (2018) · Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications · doi:10.1016/b978-0-12-813314-9.00010-4 · Cited by 637
A social spider algorithm for global optimization
Yu, J. J. Q., & Li, V. O. K. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.02.014 · Cited by 416
Self-citationA new meta-heuristic optimizer: Pathfinder algorithm
Yapici, H., & Cetinkaya, N. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.03.012 · Cited by 339
Metadata
- Authors
- Lam, A. Y. S., Li, V. O. K., & Yu, J. J. Q.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2012-06
- Volume
- 16
- Issue
- 3
- Pages
- 339-353
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2040264129
- Cited by
- 175
- References
- 4
- FWCI
- 15.08
- 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: Real-Coded Chemical Reaction Optimization. https://app.cochat.ai/papers/10.1109/tevc.2011.2161091
- The paper
- Lam, A. Y. S., Li, V. O. K., & Yu, J. J. Q. (2012). Real-Coded Chemical Reaction Optimization. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2011.2161091
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.