The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Chemical Reaction Optimization: a tutorial: (Invited paper)
Open accessAbstract
Chemical Reaction Optimization (CRO) is a recently established metaheuristics for optimization, inspired by the nature of chemical reactions. A chemical reaction is a natural process of transforming the unstable substances to the stable ones. In microscopic view, a chemical reaction starts with some unstable molecules with excessive energy. The molecules interact with each other through a sequence of elementary reactions. At the end, they are converted to those with minimum energy to support their existence. This property is embedded in CRO to solve optimization problems. CRO can be applied to tackle problems in both the discrete and continuous domains. We have successfully exploited CRO to solve a broad range of engineering problems, including the quadratic assignment problem, neural network training, multimodal continuous problems, etc. The simulation results demonstrate that CRO has superior performance when compared with other existing optimization algorithms. This tutorial aims to assist the readers in implementing CRO to solve their problems. It also serves as a technical overview of the current development of CRO and provides potential future research directions.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
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
(1979) · Cited by 43,841
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
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
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
A New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
Theory of Recursive Functions and Effective Computability
Rogers, J. H. (1987) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,998
Metadata
- Authors
- Lam, A. Y. S., & Li, V. O. K.
- Venue
- Memetic Computing
- Published
- 2012-02-12
- Volume
- 4
- Issue
- 1
- Pages
- 3-17
- ISSN
- 1865-9284 (ISSN-L)
- 1865-9292
- OpenAlex
- W2120219476
- Cited by
- 285
- References
- 38
- FWCI
- 15.20
- 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: Chemical Reaction Optimization: a tutorial: (Invited paper). https://app.cochat.ai/papers/10.1007/s12293-012-0075-1
- The paper
- Lam, A. Y. S., & Li, V. O. K. (2012). Chemical Reaction Optimization: a tutorial: (Invited paper). Memetic Computing. https://doi.org/10.1007/s12293-012-0075-1
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.