The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
ACROA: Artificial Chemical Reaction Optimization Algorithm for global optimization
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
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
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Karaboga, D., & Basturk, B. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9149-x · Cited by 7,651
Nature-Inspired Metaheuristic Algorithms
Yang, X. (2008) · Medical Entomology and Zoology · Cited by 4,556
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170072 · Cited by 4,551
Biogeography-Based Optimization
Simon, D. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.919004 · Cited by 4,305
Firefly Algorithms for Multimodal Optimization
Yang, X.-S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04944-6_14 · Cited by 4,075
Biomimicry of bacterial foraging for distributed optimization and control
(2002) · IEEE Control Systems · doi:10.1109/mcs.2002.1004010 · Cited by 3,069
Atashpaz-Gargari, E., & Lucas, C. (2007) · 2007 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2007.4425083 · Cited by 2,628
Learning and optimization using the clonal selection principle
de Castro, L. N., & Von Zuben, F. J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.1011539 · Cited by 2,240
Uniform crossover in genetic algorithms
Syswerda, G. (1989) · international conference on Genetic algorithms · Cited by 1,965
Lee, K. S., & Geem, Z. W. (2005) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2004.09.007 · Cited by 1,772
A new optimization method: Big Bang–Big Crunch
Erol, O. K., & Eksin, I. (2006) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2005.04.005 · Cited by 1,612
A novel numerical optimization algorithm inspired from weed colonization
Mehrabian, A. R., & Lucas, C. (2006) · Ecological Informatics · doi:10.1016/j.ecoinf.2006.07.003 · Cited by 1,396
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.25 · Cited by 1,199
On the Complexity of Multiple Sequence Alignment
WANG, L., & JIANG, T. (1994) · Journal of Computational Biology · doi:10.1089/cmb.1994.1.337 · Cited by 934
An Electromagnetism-like Mechanism for Global Optimization
Birbil, Ş. İ., & Fang, S.-C. (2003) · Journal of Global Optimization · doi:10.1023/a:1022452626305 · Cited by 751
Optimization, and Machine Learning
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 597
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
Chaotic bee colony algorithms for global numerical optimization
Alatas, B. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.02.042 · Cited by 551
Self-citationChaos embedded particle swarm optimization algorithms
Alatas, B., Akin, E., & Ozer, A. B. (2009) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2007.09.063 · Cited by 523
Self-citationChu, S.-C., Tsai, P.-W., & Pan, J.-S. (2006) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-36668-3_94 · Cited by 519
Chu, S.-C., Tsai, P.-W., & Pan, J.-S. (2006) · Lecture Notes in Computer Science · doi:10.1007/11801603_94 · Cited by 375
Chaotic harmony search algorithms
Alatas, B. (2010) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.03.114 · Cited by 287
Self-citationMonkey search: a novel metaheuristic search for global optimization
Mucherino, A., Şeref, O., Şeref, O., Kundakcioglu, O. E., & Pardalos, P. M. (2007) · AIP conference proceedings · doi:10.1063/1.2817338 · Cited by 286
Artificial Bee Colony Algorithm and Its Application to Generalized Assignment Problem
Baykasolu, A., Oumlzbakr, L., & Tapk, P. (2007) · doi:10.5772/5101 · Cited by 260
Alataş, B., & Akın, E. (2005) · Soft Computing · doi:10.1007/s00500-005-0476-x · Cited by 101
Gündoğan, K. K., Alataş, B., & Karcı, A. (2004) · DergiPark (Istanbul University) · Cited by 28
Wiese, K. C., Hendriks, A. G., & Deschenes, A. (2006) · IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB) · doi:10.1109/cibcb.2006.330956 · Cited by 7
Cited by
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2013.12.007 · Cited by 19,343
The Whale Optimization Algorithm
Mirjalili, S., & Lewis, A. (2016) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2016.01.008 · Cited by 14,581
Dhiman, G., & Kumar, V. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.11.024 · Cited by 1,195
Henry gas solubility optimization: A novel physics-based algorithm
Hashim, F. A., Houssein, E. H., Mabrouk, M. S., Al-Atabany, W., & Mirjalili, S. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.07.015 · Cited by 1,061
Dhiman, G., & Kumar, V. (2017) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2017.05.014 · Cited by 1,042
Metadata
- Authors
- Alatas, B.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2011-09
- Volume
- 38
- Issue
- 10
- Pages
- 13170-13180
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2039595530
- Cited by
- 420
- References
- 32
- FWCI
- 7.69
- 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.