The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
An Empirical Comparison
Abstract
Given the discussions about Evolutionary Algorithms from the previous chapters, we shall now apply them to the artificial topologies just presented. This will be done by simply running the algorithms in their standard forms (according to the definitions of standard forms as given in sections 2.1.6, 2.2.6, and 2.3.6) for a reasonable number of function evaluations on these problems. The experiment compares an algorithm that self-adapts n standard deviations and uses recombination (the Evolution Strategy), an algorithm that self-adapts n standard deviations and renounces recombination (meta-Evolutionary Programming), and an algorithm that renounces self-adaptation but stresses the role of recombination (the Genetic Algorithm). Furthermore, all algorithms rely on different selection mechanisms. With respect to the level of self-adaptation, the choice of the Evolution Strategy and Evolutionary Programming variants is fair, while the Genetic Algorithm leaves us no choice (i.e., no self-adaptation mechanism is used within the standard Genetic Algorithm). Concerning the population size the number of offspring individuals (λ) is adjusted to a common value of λ = 100 in order to achieve comparability of population sizes while at the same time limiting the computational requirements to a justifiable amount. This results in the following three algorithmic instances that are compared here (using the standard notation introduced in chapter 2): • ES(n,0,rdI, s(15,100)): An Evolution Strategy that self-adapts n standard deviations but does not use correlated mutations. Recombination is discrete on object variables and global intermediate on standard deviations, and the algorithm uses a (15,100)-selection mechanism. • mEP(6,10,100): A meta-Evolutionary Programming algorithm that — by default — self-adapts n variances and controls mutation of variances by a meta-parameter ζ = 6. The tournament size for selection and the population size amount to q = 10 and μ = 100, respectively. • GA(30,0.001,r{0.6, 2}, 5,100): A Genetic Algorithm that evolves a population of μ = 100 bitstrings of length l = 30 • n, each. The scaling window size for linear dynamic scaling is set to ω = 5. Proportional selection, a two-point crossover operator with application rate 0.6 and a mutation operator with bit-reversal probability 1.0·10−3 complete the algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Chronic Fatigue Syndrome: A Comprehensive Approach to Its Definition and Study
Fukuda, K., Straus, S. E., Hickie, I., Sharpe, M. C., Dobbins, J. G., Komaroff, A., & and International Chronic Fatigue Syndrome Study Group. (1994) · Annals of Internal Medicine · doi:10.7326/0003-4819-121-12-199412150-00009 · Cited by 4,969
Development of a fatigue scale
Chalder, T., Berelowitz, G., Pawlikowska, T., Watts, L., Wessely, S., Wright, D., & Wallace, E. P. (1993) · Journal of Psychosomatic Research · doi:10.1016/0022-3999(93)90081-p · Cited by 3,032
Cited by
PHENIX : building new software for automated crystallographic structure determination
Adams, P. D., Grosse-Kunstleve, R. W., Hung, L.-W., Ioerger, T. R., McCoy, A. J., Moriarty, N. W., Read, R. J., Sacchettini, J. C., Sauter, N. K., & Terwilliger, T. C. (2002) · Acta Crystallographica Section D Biological Crystallography · doi:10.1107/s0907444902016657 · Cited by 4,361
Big Data: New Tricks for Econometrics
Varian, H. R. (2014) · Journal of Economic Perspectives · doi:10.1257/jep.28.2.3 · Cited by 1,557
Toward a Taxonomy of Multidimensional Constructs
Law, K. S., Wong, C.-S., & Mobley, W. H. (1998) · The Academy of Management Review · doi:10.2307/259060 · Cited by 1,139
Interactive sketching for the early stages of user interface design
Landay, J. A., & Myers, B. A. (1995) · Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '95 · doi:10.1145/223904.223910 · Cited by 543
Consumer attitudes toward marketplace globalization: Structure, antecedents and consequences
Alden, D. L., Steenkamp, J.-B. E. M., & Batra, R. (2006) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2006.01.010 · Cited by 476
Metadata
- Authors
- Bäck, T.
- Venue
- Evolutionary Algorithms in Theory and Practice
- Publisher
- Oxford University Press
- Published
- 1996-02-15
- OpenAlex
- W3101583054
- Cited by
- 233
- References
- 2
- FWCI
- 4.71
- Type
- book chapter
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Empirical Comparison. https://app.cochat.ai/papers/10.1093/oso/9780195099713.003.0009
- The paper
- Bäck, T. (1996). An Empirical Comparison. Evolutionary Algorithms in Theory and Practice. https://doi.org/10.1093/oso/9780195099713.003.0009
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.