The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Chemical-Reaction-Inspired Metaheuristic for Optimization
Abstract
We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-) heuristic methods. However, the huge number of optimization problems and the small number of generally acknowledged methods mean that more metaheuristics are needed to fill the gap. We propose a new metaheuristic, called chemical reaction optimization (CRO), to solve optimization problems. It mimics the interactions of molecules in a chemical reaction to reach a low energy stable state. We tested the performance of CRO with three nondeterministic polynomial-time hard combinatorial optimization problems. Two of them were traditional benchmark problems and the other was a real-world problem. Simulation results showed that CRO is very competitive with the few existing successful metaheuristics, having outperformed them in some cases, and CRO achieved the best performance in the real-world problem. Moreover, with the No-Free-Lunch theorem, CRO must have equal performance as the others on average, but it can outperform all other metaheuristics when matched to the right problem type. Therefore, it provides a new approach for solving optimization problems. CRO may potentially solve those problems which may not be solvable with the few generally acknowledged approaches.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
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
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
(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
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
The Traveling salesman problem: a computational study
(2007) · Choice Reviews Online · doi:10.5860/choice.45-0928 · Cited by 1,726
P-Complete Approximation Problems
Sahni, S., & Gonzalez, T. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,703
(2004) · Lecture Notes in Computer Science · doi:10.1007/b99492 · Cited by 1,511
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Leung, J., Kelly, L., & Anderson, J. H. (2004) · Cited by 1,226
Ranjith Kumar, A., & Ranjith Kumar, R. (2011) · Cited by 1,225
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
The Bees Algorithm — A Novel Tool for Complex Optimisation Problems
Pham, D. T., Ghanbarzadeh, A., Koç, E., Otri, S., Rahim, S., & Zaidi, M. (2006) · Intelligent Production Machines and Systems · doi:10.1016/b978-008045157-2/50081-x · Cited by 1,142
Data mining with an ant colony optimization algorithm
Parpinelli, R. S., Lopes, H. S., & Freitas, A. A. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802452 · Cited by 985
Inspiration for optimization from social insect behaviour
Bonabeau, E., Dorigo, M., & Theraulaz, G. (2000) · Nature · doi:10.1038/35017500 · Cited by 912
Genetic Algorithms: Principles of Natural Selection Applied to Computation
Forrest, S. (1993) · Science · doi:10.1126/science.8346439 · Cited by 882
Robust taboo search for the quadratic assignment problem
Taillard, É. D. (1991) · Parallel Computing · doi:10.1016/s0167-8191(05)80147-4 · Cited by 835
Ant colony optimization for resource-constrained project scheduling
Merkle, D., Middendorf, M., & Schmeck, H. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802450 · Cited by 759
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
Ant colony optimization techniques for the vehicle routing problem
Bell, J. E., & McMullen, P. R. (2004) · Advanced Engineering Informatics · doi:10.1016/j.aei.2004.07.001 · Cited by 712
(2002) · International Series in Operations Research & Management Science · doi:10.1007/b101924 · Cited by 709
Ant colonies for the quadratic assignment problem
Gambardella, L. M., Taillard, É. D., & Dorigo, M. (1999) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600676 · Cited by 704
QAPLIB – A Quadratic Assignment Problem Library
Burkard, R. E., Karisch, S. E., & Rendl, F. (1997) · Journal of Global Optimization · doi:10.1023/a:1008293323270 · Cited by 654
Simple Explanation of the No-Free-Lunch Theorem and Its Implications
Ho, Y. C., & Pepyne, D. L. (2002) · Journal of Optimization Theory and Applications · doi:10.1023/a:1021251113462 · Cited by 562
Ant colony optimization for routing and load-balancing: survey and new directions
Sim, K. M., & Sun, W. H. (2003) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2003.817391 · Cited by 506
On benchmarking functions for genetic algorithms
Digalakis, J. G., & Margaritis, K. G. (2001) · International Journal of Computer Mathematics · doi:10.1080/00207160108805080 · Cited by 420
An improved annealing scheme for the QAP
Connolly, D. T. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90301-q · Cited by 400
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
A thermodynamically motivated simulation procedure for combinatorial optimization problems
Burkard, R. E., & Rendl, F. (1984) · European Journal of Operational Research · doi:10.1016/0377-2217(84)90231-5 · Cited by 345
Solving Quadratic Assignment Problems by ‘Simulated Annealing’
Wilhelm, M. R., & Ward, T. L. (1987) · IIE Transactions · doi:10.1080/07408178708975376 · Cited by 315
Channel assignment for cellular radio using simulated annealing
Duque-Anton, M., Kunz, D., & Ruber, B. (1993) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.192382 · Cited by 294
A Probabilistic Memetic Framework
Nguyen, Q. H., Ong, Y.-S., & Lim, M. H. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009460 · Cited by 223
Image segmentation using evolutionary computation
Bhandarkar, S. M., & Zhang, H. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.752917 · Cited by 202
Cited by
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm
Mirjalili, S. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.07.006 · Cited by 4,626
Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems
Hashim, F. A., Hussain, K., Houssein, E. H., Mabrouk, M. S., & Al-Atabany, W. (2021) · Applied Intelligence · doi:10.1007/s10489-020-01893-z · Cited by 1,134
Snake Optimizer: A novel meta-heuristic optimization algorithm
Hashim, F. A., & Hussien, A. G. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108320 · Cited by 1,106
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Beluga whale optimization: A novel nature-inspired metaheuristic algorithm
Zhong, C., Li, G., & Meng, Z. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.109215 · Cited by 903
Metadata
- Authors
- Lam, A. Y. S., & Li, V. O. K.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2010-06
- Volume
- 14
- Issue
- 3
- Pages
- 381-399
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2136554306
- Cited by
- 587
- References
- 40
- FWCI
- 9.76
- 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
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.