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,326
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
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
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 tutorial on multiobjective optimization: fundamentals and evolutionary methods
Emmerich, M. T. M., & Deutz, A. H. (2018) · Natural Computing · doi:10.1007/s11047-018-9685-y · Cited by 731
Self-Driving Laboratories for Chemistry and Materials Science
Tom, G., Schmid, S. P., Baird, S. G., Cao, Y., Darvish, K., Hao, H., Lo, S., Pablo-García, S., Rajaonson, E. M., Skreta, M., et al. (2024) · Chemical Reviews · doi:10.1021/acs.chemrev.4c00055 · Cited by 707
Data-Driven Evolutionary Optimization: An Overview and Case Studies
Jin, Y., Wang, H., Chugh, T., Guo, D., & Miettinen, K. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869001 · Cited by 686
Maier, H. R., Kapelan, Z., Kasprzyk, J., Kollat, J., Matott, L. S., Cunha, M. C., Dandy, G. C., Gibbs, M. S., Keedwell, E., Marchi, A., et al. (2014) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2014.09.013 · Cited by 657
Chugh, T., Jin, Y., Miettinen, K., Hakanen, J., & Sindhya, K. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2622301 · Cited by 625
A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization
Goh, C.-K., & Tan, K. C. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.920671 · Cited by 592
A Survey of Multiobjective Evolutionary Algorithms based on Decomposition
Trivedi, A., Srinivasan, D., Sanyal, K., & Ghosh, A. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2608507 · Cited by 549
Bayesian Optimization for Adaptive Experimental Design: A Review
Greenhill, S., Rana, S., Gupta, S., Vellanki, P., & Venkatesh, S. (2020) · IEEE Access · doi:10.1109/access.2020.2966228 · Cited by 520
Generalizing Surrogate-Assisted Evolutionary Computation
Lim, D., Jin, Y., Ong, Y.-S., & Sendhoff, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2027359 · Cited by 484
Recent Advances in Bayesian Optimization
Wang, X., Jin, Y., Schmitt, S., & Olhofer, M. (2023) · ACM Computing Surveys · doi:10.1145/3582078 · Cited by 477
Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A. M., & Talbi, E.-G. (2022) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.04.032 · Cited by 462
Pan, L., He, C., Tian, Y., Wang, H., Zhang, X., & Jin, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2802784 · Cited by 456
Surrogate-Assisted Cooperative Swarm Optimization of High-Dimensional Expensive Problems
Sun, C., Jin, Y., Cheng, R., Ding, J., & Zeng, J. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2675628 · Cited by 425
Wang, H., Jin, Y., & Doherty, J. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2710978 · Cited by 415
Kriging Is Well-Suited to Parallelize Optimization
Ginsbourger, D., Le Riche, R., & Carraro, L. (2010) · Adaptation Learning and Optimization · doi:10.1007/978-3-642-10701-6_6 · Cited by 396
Currin, A., Swainston, N., Day, P. J., & Kell, D. B. (2015) · Chemical Society Reviews · doi:10.1039/c4cs00351a · Cited by 388
Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point
Auger, A., Bader, J., Brockhoff, D., & Zitzler, E. (2009) · Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms · doi:10.1145/1527125.1527138 · Cited by 375
Kudela, J., & Matousek, R. (2022) · Soft Computing · doi:10.1007/s00500-022-07362-8 · Cited by 370
Schweidtmann, A. M., Clayton, A. D., Holmes, N., Bradford, E., Bourne, R. A., & Lapkin, A. A. (2018) · Chemical Engineering Journal · doi:10.1016/j.cej.2018.07.031 · Cited by 347
A Tutorial on Bayesian Optimization
Frazier, P. I. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.02811 · Cited by 342
Liu, B., Aliakbarian, H., Ma, Z., Vandenbosch, G. A. E., Gielen, G., & Excell, P. (2014) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2013.2283605 · Cited by 327
Multiobjective Optimization in Bioinformatics and Computational Biology
Handl, J., Kell, D. B., & Knowles, J. (2007) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2007.070203 · Cited by 308
Self-citationChugh, T., Sindhya, K., Hakanen, J., & Miettinen, K. (2019) · Soft Computing · doi:10.1007/s00500-017-2965-0 · Cited by 305
Decomposition-Based Algorithms Using Pareto Adaptive Scalarizing Methods
Wang, R., Zhang, Q., & Zhang, T. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2521175 · Cited by 283
Generalized Multitasking for Evolutionary Optimization of Expensive Problems
Ding, J., Yang, C., Jin, Y., & Chai, T. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2785351 · Cited by 277
Bradford, E., Schweidtmann, A. M., & Lapkin, A. (2018) · Journal of Global Optimization · doi:10.1007/s10898-018-0609-2 · Cited by 266
Offline Data-Driven Evolutionary Optimization Using Selective Surrogate Ensembles
Wang, H., Jin, Y., Sun, C., & Doherty, J. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2834881 · Cited by 262
A Kriging-Assisted Two-Archive Evolutionary Algorithm for Expensive Many-Objective Optimization
Song, Z., Wang, H., He, C., & Jin, Y. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3073648 · Cited by 260
Couckuyt, I., Deschrijver, D., & Dhaene, T. (2014) · Journal of Global Optimization · doi:10.1007/s10898-013-0118-2 · Cited by 254
Chimera: enabling hierarchy based multi-objective optimization for self-driving laboratories
Häse, F., Roch, L. M., & Aspuru-Guzik, A. (2018) · Chemical Science · doi:10.1039/c8sc02239a · Cited by 161
Optimization of formulations using robotic experiments driven by machine learning DoE
Cao, L., Russo, D., Felton, K., Salley, D., Sharma, A., Keenan, G., Mauer, W., Gao, H., Cronin, L., & Lapkin, A. A. (2021) · Cell Reports Physical Science · doi:10.1016/j.xcrp.2020.100295 · Cited by 75
Perrone, V., Donini, M., Zafar, M. B., Schmucker, R., Kenthapadi, K., & Archambeau, C. (2021) · Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3461702.3462629 · Cited by 66
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
- 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.