The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
A novel population initialization method for accelerating evolutionary algorithms
Open accessOverview
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
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
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
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
Brest, J., Greiner, S., Boskovic, B., Mernik, M., & Zumer, V. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.872133 · Cited by 3,077
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Opposition-Based Learning: A New Scheme for Machine Intelligence
Tizhoosh, H. R. (2006) · International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06) · doi:10.1109/cimca.2005.1631345 · Cited by 2,131
Self-citationEvolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536 · cited 1×
“Evolutionary algorithms (EAs) have been introduced to solve nonlinear complex optimization problems [1– 3].”
BackgroundDifferential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Price, K. V., Storn, R., & Lampinen, J. (2005) · Cited by 1,406
Vesterstrom, J., & Thomsen, R. (2005) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1331139 · Cited by 1,205
No Free Lunch Theorems for SearchPreprint
Wolpert, D. H., & Macready, W. G. (1995) · RePEc: Research Papers in Economics · Cited by 927
An introduction to differential evolution
Price, K. V. (1999) · McGraw-Hill Ltd., UK eBooks · Cited by 903
Ali, M. M., Khompatraporn, C., & Zabinsky, Z. B. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-9972-2 · Cited by 565
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
A Trigonometric Mutation Operation to Differential Evolution
Fan, H.-Y., & Lampinen, J. (2003) · Journal of Global Optimization · doi:10.1023/a:1024653025686 · Cited by 525
Implementation and tests of low-discrepancy sequences
Bratley, P., Fox, B. L., & Niederreiter, H. (1992) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/146382.146385 · Cited by 265
(2005) · Natural Computing Series · doi:10.1007/3-540-31306-0 · Cited by 256
Opposition-Based Reinforcement Learning
Tizhoosh, H. R., & Pattern Analysis and Machine Intelligence Laboratory, S. D. E. (2006) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2006.p0578 · Cited by 204
Self-citationImproved Differential Evolution Algorithms for Handling Noisy Optimization Problems
Das, S., Konar, A., & Chakraborty, U. K. (2005) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2005.1554892 · Cited by 84
Cited by
On hyperparameter optimization of machine learning algorithms: Theory and practice
Yang, L., & Shami, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.07.061 · Cited by 3,232
A literature survey of benchmark functions for global optimisation problems
Jamil, M., & Yang, X. S. (2013) · International Journal of Mathematical Modelling and Numerical Optimisation · doi:10.1504/ijmmno.2013.055204 · Cited by 1,301
Differential Evolution: A review of more than two decades of research
Bilal, Pant, M., Zaheer, H., Garcia-Hernandez, L., & Abraham, A. (2020) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2020.103479 · Cited by 1,002
Differential Evolution: A Recent Review Based on State-of-the-Art Works
Ahmad, M. F., Isa, N. A. M., Lim, W. H., & Ang, K. M. (2022) · Alexandria Engineering Journal · doi:10.1016/j.aej.2021.09.013 · Cited by 579
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
Metadata
- Authors
- Rahnamayan, S., Tizhoosh, H. R., & Salama, M. M. A.
- Venue
- Computers & Mathematics with Applications
- Publisher
- Elsevier BV
- Published
- 2007-05
- Volume
- 53
- Issue
- 10
- Pages
- 1605-1614
- ISSN
- 0898-1221 (ISSN-L)
- OpenAlex
- W2084993914
- Cited by
- 374
- References
- 23
- FWCI
- 18.12
- Type
- journal article
- Language
- en
- Open access
- bronze
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.