The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems
Abstract
This paper concerns multiobjective optimization in scenarios where each solution evaluation is financially and/or temporally expensive. We make use of nine relatively low-dimensional, nonpathological, real-valued functions, such as arise in many applications, and assess the performance of two algorithms after just 100 and 250 (or 260) function evaluations. The results show that NSGA-II, a popular multiobjective evolutionary algorithm, performs well compared with random search, even within the restricted number of evaluations used. A significantly better performance (particularly, in the worst case) is, however, achieved on our test set by an algorithm proposed herein-ParEGO-which is an extension of the single-objective efficient global optimization (EGO) algorithm of Jones et al. ParEGO uses a design-of-experiments inspired initialization procedure and learns a Gaussian processes model of the search landscape, which is updated after every function evaluation. Overall, ParEGO exhibits a promising performance for multiobjective optimization problems where evaluations are expensive or otherwise restricted in number.
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
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 17,328
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
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
Empirical Model Building and Response Surfaces
Freeny, A. (1988) · Technometrics · doi:10.1080/00401706.1988.10488371 · Cited by 5,235
Handling multiple objectives with particle swarm optimization
Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826067 · Cited by 4,455
Numerical Recipes in C: The Art of Scientific Computing.
Birchenhall, C., Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · The Economic Journal · doi:10.2307/2234664 · Cited by 4,355
Performance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330
Myers, R. H., & Montgomery, D. C. (1996) · IIE Transactions · doi:10.1080/15458830.1996.11770760 · Cited by 3,819
Evolutionary Algorithms for Solving Multi-Objective Problems
Coello Coello, C. A., Van Veldhuizen, D. A., & Lamont, G. B. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4757-5184-0 · Cited by 2,663
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
Self-citationScalable Test Problems for Evolutionary Multiobjective Optimization
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_6 · Cited by 2,010
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
The Lack of A Priori Distinctions Between Learning Algorithms
Wolpert, D. H. (1996) · Neural Computation · doi:10.1162/neco.1996.8.7.1341 · Cited by 1,647
Improving generalization with active learning
Cohn, D., Atlas, L., & Ladner, R. (1994) · Machine Learning · doi:10.1007/bf00993277 · Cited by 1,591
PESA-II: region-based selection in evolutionary multiobjective optimization
Corne, D., Jerram, N. R., Knowles, J. D., & Oates, M. J. (2001) · Genetic and Evolutionary Computation Conference (GECCO) · Cited by 1,249
Self-citationA comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229
An updated survey of GA-based multiobjective optimization techniques
Coello, C. A. (2000) · ACM Computing Surveys · doi:10.1145/358923.358929 · Cited by 773
Empirical Model-Building and Response Surfaces.
Pike, D. J., Box, G. E. P., & Draper, N. R. (1988) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982196 · Cited by 716
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
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
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
Self-citationEvolutionary 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
Reducing the Run-Time Complexity of Multiobjective EAs: The NSGA-II and Other Algorithms
Jensen, M. T. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.817234 · Cited by 458
Multiobjective evolutionary algorithm test suites
van Veldhuizen, D. A., & Lamont, G. B. (1999) · Proceedings of the 1999 ACM symposium on Applied computing · doi:10.1145/298151.298382 · Cited by 447
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Deb, K., & Beyer, H.-G. (2001) · Evolutionary Computation · doi:10.1162/106365601750190406 · Cited by 437
A Micro-Genetic Algorithm for Multiobjective Optimization
Coello Coello Coello, C. A., & Toscano Pulido, G. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44719-9_9 · Cited by 414
On the performance assessment and comparison of stochastic multiobjective optimizers
Fonseca, C. M., & Fleming, P. J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_1022 · Cited by 378
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
Giannakoglou, K. C. (2002) · Progress in Aerospace Sciences · doi:10.1016/s0376-0421(01)00019-7 · Cited by 259
Copeland, K. A. F. (1996) · Journal of Quality Technology · doi:10.1080/00224065.1996.11979672 · Cited by 178
O’Hagan, S., Dunn, W. B., Brown, M., Knowles, J. D., & Kell, D. B. (2004) · Analytical Chemistry · doi:10.1021/ac049146x · Cited by 164
Self-citationA metabolome pipeline: from concept to data to knowledge
Brown, M., Dunn, W. B., Ellis, D. I., Goodacre, R., Handl, J., Knowles, J. D., O’Hagan, S., Spasić, I., & Kell, D. B. (2005) · Metabolomics · doi:10.1007/s11306-005-1106-4 · Cited by 162
Self-citationLocal 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
Ong, Y.-S., Nair, P. B., Keane, A. J., et al. (2005) · Studies in fuzziness and soft computing · doi:10.1007/978-3-540-44511-1_15 · Cited by 149
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
Airfoil and Wing Design Through Hybrid Optimization Strategies
Vicini, A., & Quagliarella, D. (1999) · AIAA Journal · doi:10.2514/3.14219 · Cited by 143
On Test Functions for Evolutionary Multi-objective Optimization
Okabe, T., Jin, Y., Olhofer, M., et al. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30217-9_80 · Cited by 115
Evans, J., Edirisinghe, M. J., Coveney, P. V., & Eames, J. (2001) · Journal of the European Ceramic Society · doi:10.1016/s0955-2219(01)00289-8 · Cited by 74
Explanatory Optimization of Protein Mass Spectrometry via Genetic Search
Vaidyanathan, S., Broadhurst, D., Kell, D. B., & Goodacre, R. (2003) · Analytical Chemistry · doi:10.1021/ac034669a · Cited by 45
Efficient Improvement of Silage Additives by Using Genetic Algorithms
Davies, Z., Gilbert, R. J., Merry, R. J., Kell, D. B., Theodorou, M. K., & Griffith, G. W. (2000) · Applied and Environmental Microbiology · doi:10.1128/aem.66.4.1435-1443.2000 · Cited by 37
Corne, D., Oates, M. J., & Kell, D. B. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36605-9_18 · Cited by 13
Cited by
Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]
Tian, Y., Cheng, R., Zhang, X., & Jin, Y. (2017) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2017.2742868 · Cited by 2,777
Multiobjective evolutionary algorithms: A survey of the state of the art
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.03.001 · Cited by 2,255
Surrogate-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
Review of surrogate modeling in water resources
Razavi, S., Tolson, B. A., & Burn, D. H. (2012) · Water Resources Research · doi:10.1029/2011wr011527 · Cited by 983
Frazier, P. I. (2018) · Recent Advances in Optimization and Modeling of Contemporary Problems · doi:10.1287/educ.2018.0188 · Cited by 826
Metadata
- Authors
- Knowles, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2006-02
- Volume
- 10
- Issue
- 1
- Pages
- 50-66
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2111526171
- Cited by
- 1,254
- References
- 46
- FWCI
- 33.49
- 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.