The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
On self-adaptive features in real-parameter evolutionary algorithms
Abstract
Due to the flexibility in adapting to different fitness landscapes, self-adaptive evolutionary algorithms (SA-EAs) have been gaining popularity in the recent past. In this paper, we postulate the properties that SA-EA operators should have for successful applications in real-valued search spaces. Specifically, population mean and variance of a number of SA-EA operators such as various real-parameter crossover operators and self-adaptive evolution strategies are calculated for this purpose. Simulation results are shown to verify the theoretical calculations. The postulations and population variance calculations explain why self-adaptive genetic algorithms and evolution strategies have shown similar performance in the past and also suggest appropriate strategy parameter values, which must be chosen while applying and comparing different SA-EAs.
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
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
Self-citationEvolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution
Rechenberg, I. (1973) · Frommann-Holzboog eBooks · Cited by 2,440
Schwefel, H. (1995) · Cited by 2,203
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1994) · Springer eBooks · doi:10.1007/978-3-662-07418-3 · Cited by 2,158
An Overview of Evolutionary Algorithms for Parameter Optimization
Bäck, T., & Schwefel, H.-P. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.1 · Cited by 2,111
Real-Coded Genetic Algorithms and Interval-Schemata
Eshelman, L. J., & Schaffer, J. D. (1993) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-094832-4.50018-0 · Cited by 1,650
Numerical optimization of computer models
(1982) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(82)90117-3 · Cited by 1,624
Cited by
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Evolution strategies – A comprehensive introduction
Beyer, H.-G., & Schwefel, H.-P. (2002) · Natural Computing · doi:10.1023/a:1015059928466 · Cited by 2,790
Self-citationThe CMA Evolution Strategy: A Comparing Review
Hansen, N. (2007) · Studies in Fuzziness and Soft Computing · doi:10.1007/3-540-32494-1_4 · Cited by 1,797
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization
Deb, K., Anand, A., & Joshi, D. (2002) · Evolutionary Computation · doi:10.1162/106365602760972767 · Cited by 614
Self-citationAccelerating Differential Evolution Using an Adaptive Local Search
Noman, N., & Iba, H. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.895272 · Cited by 610
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Deb, K., & Beyer, H.-G. (2001) · Evolutionary Computation · doi:10.1162/106365601750190406 · Cited by 437
Self-citationSelf-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces
Vrugt, J. A., Robinson, B. A., & Hyman, J. M. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.924428 · Cited by 334
Hansen, N., Niederberger, A. S. P., Guzzella, L., & Koumoutsakos, P. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.924423 · Cited by 323
Learning probability distributions in continuous evolutionary algorithms – a comparative review
Kern, S., Müller, S. D., Hansen, N., Büche, D., Ocenasek, J., & Koumoutsakos, P. (2004) · Natural Computing · doi:10.1023/b:naco.0000023416.59689.4e · Cited by 268
Global and local real-coded genetic algorithms based on parent-centric crossover operators
García-Martínez, C., Lozano, M., Herrera, F., Molina, D., & Sánchez, A. M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.043 · Cited by 268
Testing vision-based control systems using learnable evolutionary algorithms
Abdessalem, R. B., Nejati, S., Briand, L. C., & Stifter, T. (2018) · Proceedings of the 40th International Conference on Software Engineering · doi:10.1145/3180155.3180160 · Cited by 262
Metadata
- Authors
- Beyer, H.-G., & Deb, K.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2001-06
- Volume
- 5
- Issue
- 3
- Pages
- 250-270
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2141554323
- Cited by
- 264
- References
- 30
- FWCI
- 8.26
- 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.