A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms
The DOI matches its Crossref record; 104 of the 104 references it cites were found in a registry or an index.
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
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,466
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069 · cited 4×
“(2010), Kriging was used as a metamodel with the decomposition-based EA MOEA/D (Zhang and Li 2007).”
MethodInfluentialPattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
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 · cited 18×
“, selection of nondominated individuals, using expected improvement Jones et al. (1998), expected hypervolume improvement Ponweiser et al.”
BackgroundMethodInfluentialAlgorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
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
Global sensitivity indices for nonlinear mathematical models and their monte carlo estimates
Sobol′, I. M. (2001) · Mathematics and Computers in Simulation · doi:10.1016/s0378-4754(00)00270-6 · Cited by 6,389 · cited 5×
“Roy andDeb (2016) used a high-dimensionalmodel representation (HDMR) by Sobol (2001) as a metamodel for each objective function.”
MethodInfluential
Cited by
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
Self-citationChugh, T., Jin, Y., Miettinen, K., Hakanen, J., & Sindhya, K. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2622301 · Cited by 625
Self-citationPan, 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
Evolutionary Large-Scale Multi-Objective Optimization: A Survey
Tian, Y., Si, L., Zhang, X., Cheng, R., He, C., Tan, K. C., & Jin, Y. (2022) · ACM Computing Surveys · doi:10.1145/3470971 · Cited by 401
Hua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
Boosting Data-Driven Evolutionary Algorithm With Localized Data Generation
Li, J.-Y., Zhan, Z.-H., Wang, C., Jin, H., & Zhang, J. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2020.2979740 · Cited by 164
“As a number of DDEAs are proposed for solving multiobjective [32], [33] or many-objective problems [34], the following contents will also clarify their multi-/many-objective characteristics when surveying them among the offline and online DDEAs.”
BackgroundHabib, A., Singh, H. K., Chugh, T., Ray, T., & Miettinen, K. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2899030 · Cited by 161
“Recently, there has been a growing trend toward employing surrogate models within MOEA frameworks, as evident from the review papers [7], [15].”
BackgroundMethodSelf-citationSong, Z., Wang, H., & Jin, Y. (2023) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2023.3281822 · Cited by 38
Metadata
- Authors
- Chugh, T., Sindhya, K., Hakanen, J., & Miettinen, K.
- Venue
- Soft Computing
- Published
- 2017-12-11
- Volume
- 23
- Issue
- 9
- Pages
- 3137-3166
- ISSN
- 1432-7643 (ISSN-L)
- 1433-7479
- OpenAlex
- W2772079570
- Cited by
- 305
- References
- 104
- FWCI
- 15.36
- 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.