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.
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
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
(2004) · Lecture Notes in Computer Science · doi:10.1007/b99492 · Cited by 1,511
Ranjith Kumar, A., & Ranjith Kumar, R. (2011) · Cited by 1,225
Proceedings of the IEEE International Conference on Communications
McLaughlin, S., Mulgrew, B., & Cowan, C. F. N. (1989) · Cited by 787
A survey for the quadratic assignment problem
Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.09.032 · Cited by 741
A Survey of Particle Swarm Optimization Applications in Electric Power Systems
AlRashidi, M. R., & El-Hawary, M. E. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.880326 · Cited by 720
(2002) · International Series in Operations Research & Management Science · doi:10.1007/b101924 · Cited by 709
The Mathematical Theory of Selection, Recombination, and Mutation
Buerger, R. (2000) · IIASA PURE (International Institute of Applied Systems Analysis) · Cited by 608
Chemical-Reaction-Inspired Metaheuristic for Optimization
Lam, A. Y. S., & Li, V. O. K. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033580 · Cited by 587
Self-citationTai, B. Y. T. (2003) · International Journal of Constitutional Law · doi:10.1093/icon/1.1.147 · Cited by 584
Utilization and fairness in spectrum assignment for opportunistic spectrum access
Peng, C., Zheng, H., & Zhao, B. Y. (2006) · Mobile Networks and Applications · doi:10.1007/s11036-006-7322-y · Cited by 531
A Multi-Facet Survey on Memetic Computation
Chen, X., Ong, Y.-S., Lim, M.-H., & Tan, K. C. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2132725 · Cited by 512
Memetic Computation—Past, Present & Future [Research Frontier
Ong, Y.-S., Lim, M., & Chen, X. (2010) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2010.936309 · Cited by 419
Evolutionary Computation for Modeling and Optimization
(2006) · Springer eBooks · doi:10.1007/0-387-31909-3 · Cited by 401
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks
Subramanian, A. P., Gupta, H., Das, S. R., & Cao, J. (2008) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2008.70 · Cited by 377
The status of the P versus NP problem
Fortnow, L. (2009) · Communications of the ACM · doi:10.1145/1562164.1562186 · Cited by 321
Thermodynamics: An Advanced Treatment for Chemists and Physicists
Guggenheim, E. A., & Woolley, H. W. (1957) · Physics Today · doi:10.1063/1.3060168 · Cited by 293
(2005) · Natural Computing Series · doi:10.1007/3-540-31306-0 · Cited by 256
Evolving Least Squares Support Vector Machines for Stock Market Trend Mining
Yu, L., Chen, H., Wang, S., & Lai, K. K. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.928176 · Cited by 218
Multiobjective Evolutionary Optimization of DNA Sequences for Reliable DNA Computing
Shin, S.-Y., Lee, I.-H., Kim, D., & Zhang, B.-T. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.844166 · Cited by 197
Chemical Reaction Optimization for Task Scheduling in Grid Computing
Xu, J., Lam, A. Y. S., & Li, V. O. K. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2011.35 · Cited by 173
Self-citationTheoretical Aspects of Evolutionary Computing
(2001) · Natural computing series · doi:10.1007/978-3-662-04448-3 · Cited by 169
Mutation-Based Genetic Neural Network
Palmes, P. P., Hayasaka, T., & Usui, S. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.844858 · Cited by 162
Evolutionary artificial neural network based on Chemical Reaction Optimization
Yu, J. J. Q., Lam, A. Y. S., & Li, V. O. K. (2011) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2011.5949872 · Cited by 103
Self-citationA hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments
Ritchie, G., & Levine, J. (2004) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · Cited by 97
Evolutionary Approaches To Minimizing Network Coding Resources
Kim, M., Médard, M., Aggarwal, V., O’Reilly, U.-M., Kim, W. B., Ahn, C. W., & Effros, M. (2007) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2007.231 · Cited by 92
Chemical Reaction Optimization for the Grid Scheduling Problem
Xu, J., Lam, A. Y. S., & Li, V. O. K. (2010) · International Conference on Communications · doi:10.1109/icc.2010.5502406 · Cited by 67
Self-citationShadbolt, N. (2004) · IEEE Intelligent Systems · doi:10.1109/mis.2004.1265875 · Cited by 36
Parallel chemical reaction optimization for the quadratic assignment problem
Xu, J., Lam, A. Y. S., & Li, V. O. K. (2010) · GEM · Cited by 25
Self-citation
Cited by
Electric eel foraging optimization: A new bio-inspired optimizer for engineering applications
Zhao, W., Wang, L., Zhang, Z., Fan, H., Zhang, J., Mirjalili, S., Khodadadi, N., & Cao, Q. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122200 · Cited by 318
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
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.