The DOI matches its Crossref record; 73 of the 73 references it cites were found in a registry or an index.
Single- and multiobjective evolutionary optimization assisted by Gaussian random field metamodels
Open accessAbstract
This paper presents and analyzes in detail an efficient search method based on evolutionary algorithms (EA) assisted by local Gaussian random field metamodels (GRFM). It is created for the use in optimization problems with one (or many) computationally expensive evaluation function(s). The role of GRFM is to predict objective function values for new candidate solutions by exploiting information recorded during previous evaluations. Moreover, GRFM are able to provide estimates of the confidence of their predictions. Predictions and their confidence intervals predicted by GRFM are used by the metamodel assisted EA. It selects the promising members in each generation and carries out exact, costly evaluations only for them. The extensive use of the uncertainty information of predictions for screening the candidate solutions makes it possible to significantly reduce the computational cost of singleand multiobjective EA. This is adequately demonstrated in this paper by means of mathematical test cases and a multipoint airfoil design in aerodynamics
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Partial Differential Equations
(1988) · Lecture Notes in Mathematics · doi:10.1007/bfb0082920 · Cited by 23,383
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
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
Numerical recipes in Pascal: the art of scientific computing
(1990) · Choice Reviews Online · doi:10.5860/choice.27-5158 · Cited by 11,811
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
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
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_83 · Cited by 5,289
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Nonlinear Multiobjective Optimization
Miettinen, K. (1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5563-6 · Cited by 4,710
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Numerical recipes in Fortran (The art of scientific computing)
Ames, W. F., & Brezinski, C. (1993) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(93)90043-t · Cited by 4,304
`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
Genetics and the Origin of Species
(1952) · AIBS Bulletin · doi:10.1093/aibsbulletin/2.2.14-b · Cited by 3,935
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
Evolution strategies – A comprehensive introduction
Beyer, H.-G., & Schwefel, H.-P. (2002) · Natural Computing · doi:10.1023/a:1015059928466 · Cited by 2,790
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Multiobjective optimization using evolutionary algorithms — A comparative case study
Zitzler, E., & Thiele, L. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056872 · Cited by 2,262
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
How to Solve It: Modern Heuristics
Michalewicz, Z., & Fogel, D. B. (2000) · Springer eBooks · doi:10.1007/978-3-662-04131-4 · Cited by 2,207
Schwefel, H. (1995) · Cited by 2,203
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
Törn, A., & Žilinskas, A. (1989) · Cited by 1,673
Handbook of Global Optimization
(1995) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4615-2025-2 · Cited by 1,628
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
On the Convergence of Pattern Search Algorithms
Torczon, V. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623493250780 · Cited by 1,336
The Geometry of Random Fields.
Gray, L. F., & Adler, R. J. (1982) · Journal of the American Statistical Association · doi:10.2307/2287334 · Cited by 1,285
A comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229
Kendall, W. S. (1982) · Bulletin of the London Mathematical Society · doi:10.1112/blms/14.1.59 · Cited by 1,040
Adler, R. J. (2010) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718980 · Cited by 977
(2004) · Lecture Notes in Computer Science · doi:10.1007/b98643 · Cited by 957
The Theory of Evolution Strategies
Beyer, H.-G. (2001) · Natural Computing Series · doi:10.1007/978-3-662-04378-3 · Cited by 878
Goal programming and multiple objective optimizations
Charnes, A., & Cooper, W. W. (1977) · European Journal of Operational Research · doi:10.1016/s0377-2217(77)81007-2 · Cited by 742
A Connectionist Machine for Genetic Hillclimbing
Ackley, D. H. (1987) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4613-1997-9 · Cited by 731
A framework for evolutionary optimization with approximate fitness functions
Jin, Y., Olhofer, M., & Sendhoff, B. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.800884 · Cited by 662
Direct search methods: then and now
Lewis, R. M., Torczon, V., & Trosset, M. W. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00423-4 · Cited by 648
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Emmerich, M., Beume, N., & Naujoks, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31880-4_5 · Cited by 604
Self-citationIntroduction to Monte Carlo Methods
Mackay, D. J. C. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_7 · Cited by 572
On metrics for comparing nondominated sets
Knowles, J., & Corne, D. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007013 · Cited by 560
Evolutionary Optimization of Computationally Expensive Problems via Surrogate Modeling
Ong, Y. S., Nair, P. B., & Keane, A. J. (2003) · AIAA Journal · doi:10.2514/2.1999 · Cited by 555
Global versus local search in constrained optimization of computer models
Schonlau, M., Welch, W. J., & Jones, D. R. (1998) · Institute of Mathematical Statistics Lecture Notes - Monograph Series · doi:10.1214/lnms/1215456182 · Cited by 435
SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2
Kim, M., Hiroyasu, T., Miki, M., & Watanabe, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30217-9_75 · Cited by 409
Accelerating Evolutionary Algorithms With Gaussian Process Fitness Function Models
Buche, D., Schraudolph, N. N., & Koumoutsakos, P. (2005) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2004.841917 · Cited by 335
Neural networks and machine learning
Bishop, C. (1998) · Springer eBooks · Cited by 316
Properties of an adaptive archiving algorithm for storing nondominated vectors
Knowles, J., & Corne, D. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810755 · Cited by 303
A statistical method for global optimization
Cox, D. D., & John, S. (2003) · [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.1992.271617 · Cited by 302
Bowman, V. J. (1976) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-87563-2_5 · Cited by 277
A NOTE ON WEIGHTED CRITERIA METHODS FOR COMPROMISE SOLUTIONS IN MULTI-OBJECTIVE OPTIMIZATION
ATHAN, T. W., & PAPALAMBROS, P. Y. (1996) · Engineering Optimization · doi:10.1080/03052159608941404 · Cited by 271
Giannakoglou, K. C. (2002) · Progress in Aerospace Sciences · doi:10.1016/s0376-0421(01)00019-7 · Cited by 259
Self-citationParedis, J. (1995) · Artificial Life · doi:10.1162/artl.1995.2.355 · Cited by 229
Step-size adaptation based on non-local use of selection information
Ostermeier, A., Gawelczyk, A., & Hansen, N. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58484-6_263 · Cited by 199
Multiobjective genetic algorithms with application to control engineering problems.
Fonseca, C. M. (1995) · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York) · Cited by 192
Faster convergence by means of fitness estimation
Branke, J., & Schmidt, C. (2003) · Soft Computing · doi:10.1007/s00500-003-0329-4 · Cited by 169
On the complexity of polynomial matrix computations
Pascal Giorgi, A., Jeannerod, C.-P., & Villard, G. (2003) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/860854.860889 · Cited by 157
Local Function Approximation in Evolutionary Algorithms for the Optimization of Costly Functions
Regis, R. G., & Shoemaker, C. A. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.835247 · Cited by 156
Accelerating the convergence of evolutionary algorithms by fitness landscape approximation
Ratle, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0056852 · Cited by 144
(2007) · Choice Reviews Online · doi:10.5860/choice.44-6576 · Cited by 141
Evolution strategies assisted by Gaussian processes with improved preselection criterion
Ulmer, H., Streichert, F., & Zell, A. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2003.1299643 · Cited by 123
Structure optimization of neural networks for evolutionary design optimization
H�sken, M., Jin, Y., & Sendhoff, B. (2003) · Soft Computing · doi:10.1007/s00500-003-0330-y · Cited by 123
The Design and Analysis of Computer Experiments
Deng, L. (2004) · Technometrics · doi:10.1198/tech.2004.s230 · Cited by 122
A Comparison of Evolution Strategies with Other Direct Search Methods in the Presence of Noise
Arnold, D. V., & Beyer, H.-G. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021810301763 · Cited by 94
On the Complexity of Matrix Product
Raz, R. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702402147 · Cited by 84
Kriging, cokriging, radial basis functions and the role of positive definiteness
Myers, D. E. (1992) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(92)90176-i · Cited by 82
A study of gold and uranium distribution patterns in the Klerksdorp gold field
Krige, D. (1966) · Geoexploration · doi:10.1016/0016-7142(66)90010-x · Cited by 52
Error estimates for modified local Shepard's interpolation formula
Zuppa, C. (2003) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2003.11.001 · Cited by 26
Deep insight from simple models of evolution
Schwefel, H. (2002) · Biosystems · doi:10.1016/s0303-2647(01)00186-1 · Cited by 18
Cited by
Expensive Multiobjective Optimization by MOEA/D With Gaussian Process Model
Zhang, Q., Liu, W., Tsang, E., & Virginas, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033671 · Cited by 746
A Survey on the Hypervolume Indicator in Evolutionary Multiobjective Optimization
Shang, K., Ishibuchi, H., He, L., & Pang, L. M. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2020.3013290 · Cited by 380
Multi-objective Bayesian optimization using Pareto-frontier entropy
Suzuki, S., Takeno, S., Tamura, T., Shitara, K., & Karasuyama, M. (2019) · arXiv · doi:10.48550/arxiv.1906.00127 · Cited by 40
Metadata
- Authors
- Emmerich, M. T. M., Giannakoglou, K. C., & Naujoks, B.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2006-08
- Volume
- 10
- Issue
- 4
- Pages
- 421-439
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2136918060
- Cited by
- 759
- References
- 73
- FWCI
- 19.48
- Type
- journal article
- Language
- en
- Open access
- green
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.