The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A framework for evolutionary optimization with approximate fitness functions
Abstract
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are unclear due to the approximation error of the model. In this paper, extensive empirical studies are carried out to investigate the convergence properties of an evolution strategy using an approximate fitness function on two benchmark problems. It is found that incorrect convergence will occur if the approximate model has false optima. To address this problem, individual- and generation-based evolution control are introduced and the resulting effects on the convergence properties are presented. A framework for managing approximate models in generation-based evolution control is proposed. This framework is well suited for parallel evolutionary optimization, which is able to guarantee the correct convergence of the evolutionary algorithm, as well as to reduce the computation cost as much as possible. Control of the evolution and updating of the approximate models are based on the estimated fidelity of the approximate model. Numerical results are presented for three test problems and for an aerodynamic design example.
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 Origins of Order: Self-Organization and Selection in Evolution
Kauffman, S. A. (1993) · doi:10.1093/oso/9780195079517.001.0001 · Cited by 7,855
Design and Analysis of Computer Experiments
Sacks, J., Welch, W. J., Mitchell, T. J., & Wynn, H. P. (1989) · Statistical Science · doi:10.1214/ss/1177012413 · Cited by 6,919
The origins of order; self organization and selection in evolution
(1994) · International Journal of Biochemistry · doi:10.1016/0020-711x(94)90119-8 · Cited by 6,649
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Myers, R. H., & Montgomery, D. C. (1996) · IIE Transactions · doi:10.1080/15458830.1996.11770760 · Cited by 3,819
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
Piegl, L., & Tiller, W. (1997) · Monographs in Visual Communication · doi:10.1007/978-3-642-59223-2 · Cited by 2,871
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Fogel, D. B. (1995) · IEEE Press eBooks · Cited by 2,283
Evolutionary computation: Toward a new philosophy of machine intelligence
B�ck, T. (1997) · Complexity · doi:10.1002/(sici)1099-0526(199703/04)2:4<28::aid-cplx7>3.0.co;2-2 · Cited by 1,533
Cited by
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Gad, A. G. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-021-09694-4 · Cited by 1,869
Evolutionary Optimization in Uncertain Environments—A Survey
Jin, Y., & Branke, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846356 · Cited by 1,572
Self-citationSurrogate-assisted evolutionary computation: Recent advances and future challenges
Jin, Y. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.05.001 · Cited by 1,514
Self-citationKnowles, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851274 · Cited by 1,254
Metadata
- Authors
- Jin, Y., Olhofer, M., & Sendhoff, B.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2002-10
- Volume
- 6
- Issue
- 5
- Pages
- 481-494
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2166739626
- Cited by
- 662
- References
- 33
- FWCI
- 19.40
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A framework for evolutionary optimization with approximate fitness functions. https://app.cochat.ai/papers/10.1109/tevc.2002.800884
- The paper
- Jin, Y., Olhofer, M., & Sendhoff, B. (2002). A framework for evolutionary optimization with approximate fitness functions. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2002.800884
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.