The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Statistical Improvement Criteria for Use in Multiobjective Design Optimization
Abstract
Design of experiment and response surface modeling methods are applied to the problem of constructing Pareto fronts for computationally expensive multiobjective design optimization problems. The work presented combines design of experiment methods with kriging (Gaussian process) models to enable the parallel evolution of multiobjective Pareto sets. This is achieved via the use of updating schemes based on new extensions of the expected improvement criterion commonly applied in single-objective searches. The approaches described provide a statistically coherent means of solving expensive multiobjective design problems using single-objective search tools. They are compared to the use of nondominated sorting genetic algorithm (NSGA-ii) based multiobjective searches, both with and without response surface support. The new approaches are shown to give more exact, wider ranging, and more evenly populated Pareto fronts than the genetic algorithm based searches at reduced or similar cost.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Goldberg, D. E. (1989) · Medical Entomology and Zoology · Cited by 10,109
Response Surface Methodology: Process and Product Optimization Using Designed Experiments
Gunst, R. F., Myers, R. H., & Montgomery, D. C. (1996) · Technometrics · doi:10.2307/1270613 · Cited by 9,530
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
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
Cressie, N. A. C. (1993) · Wiley Series in Probability and Statistics · doi:10.1002/9781119115151 · Cited by 6,507
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
Cited by
Recent advances in surrogate-based optimization
Forrester, A. I. J., & Keane, A. J. (2009) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2008.11.001 · Cited by 2,357
Self-citationMultiobjective 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
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
Lookman, T., Balachandran, P. V., Xue, D., & Yuan, R. (2019) · npj Computational Materials · doi:10.1038/s41524-019-0153-8 · Cited by 832
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
Recent Advances in Bayesian Optimization
Wang, X., Jin, Y., Schmitt, S., & Olhofer, M. (2023) · ACM Computing Surveys · doi:10.1145/3582078 · Cited by 477
On design optimization for structural crashworthiness and its state of the art
Fang, J., Sun, G., Qiu, N., Kim, N. H., & Li, Q. (2017) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-016-1579-y · Cited by 433
Nandy, A., Duan, C., Taylor, M. G., Liu, F., Steeves, A. H., & Kulik, H. J. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00347 · Cited by 358
A Tutorial on Bayesian Optimization
Frazier, P. I. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.02811 · Cited by 342
Chugh, T., Sindhya, K., Hakanen, J., & Miettinen, K. (2019) · Soft Computing · doi:10.1007/s00500-017-2965-0 · Cited by 305
Bradford, E., Schweidtmann, A. M., & Lapkin, A. (2018) · Journal of Global Optimization · doi:10.1007/s10898-018-0609-2 · Cited by 266
Couckuyt, I., Deschrijver, D., & Dhaene, T. (2014) · Journal of Global Optimization · doi:10.1007/s10898-013-0118-2 · Cited by 254
Janet, J. P., Ramesh, S., Duan, C., & Kulik, H. J. (2020) · ACS Central Science · doi:10.1021/acscentsci.0c00026 · Cited by 200
“We therefore extended the two-dimensional EI 51,52 approach to chemical design (Algorithm S1).”
Metadata
- Authors
- Keane, A. J.
- Venue
- AIAA Journal
- Published
- 2006-04
- Volume
- 44
- Issue
- 4
- Pages
- 879-891
- ISSN
- 0001-1452 (ISSN-L)
- 1533-385X
- OpenAlex
- W2098629435
- Cited by
- 312
- References
- 23
- FWCI
- 11.28
- 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.