The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Pareto Corner Search Evolutionary Algorithm and Dimensionality Reduction in Many-Objective Optimization Problems
Abstract
Many-objective optimization refers to the optimization problems containing large number of objectives, typically more than four. Non-dominance is an inadequate strategy for convergence to the Pareto front for such problems, as almost all solutions in the population become non-dominated, resulting in loss of convergence pressure. However, for some problems, it may be possible to generate the Pareto front using only a few of the objectives, rendering the rest of the objectives redundant. Such problems may be reducible to a manageable number of relevant objectives, which can be optimized using conventional multiobjective evolutionary algorithms (MOEAs). For dimensionality reduction, most proposals in the paper rely on analysis of a representative set of solutions obtained by running a conventional MOEA for a large number of generations, which is computationally overbearing. A novel algorithm, Pareto corner search evolutionary algorithm (PCSEA), is introduced in this paper, which searches for the corners of the Pareto front instead of searching for the complete Pareto front. The solutions obtained using PCSEA are then used for dimensionality reduction to identify the relevant objectives. The potential of the proposed approach is demonstrated by studying its performance on a set of benchmark test problems and two engineering examples. While the preliminary results obtained using PCSEA are promising, there are a number of areas that need further investigation. This paper provides a number of useful insights into dimensionality reduction and, in particular, highlights some of the roadblocks that need to be cleared for future development of algorithms attempting to use few selected solutions for identifying relevant objectives.
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
Techniques for highly multiobjective optimisation: some nondominated points are better than others
Corne, D. W., & Knowles, J. D. (2007) · Proceedings of the 9th annual conference on Genetic and evolutionary computation · doi:10.1145/1276958.1277115 · Cited by 273
Cited by
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
Cheng, R., Jin, Y., Olhofer, M., & Sendhoff, B. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2519378 · Cited by 1,760
A Grid-Based Evolutionary Algorithm for Many-Objective Optimization
Yang, S., Li, M., Liu, X., & Zheng, J. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2227145 · Cited by 893
A Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization
Zhang, X., Tian, Y., & Jin, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2378512 · Cited by 867
Many-Objective Evolutionary Algorithms: A Survey
Li, B., Li, J., Tang, K., & Yao, X. (2015) · ACM Computing Surveys · doi:10.1145/2792984 · Cited by 815
MOEA/D with Adaptive Weight Adjustment
Qi, Y., Ma, X., Liu, F., Jiao, L., Sun, J., & Wu, J. (2014) · Evolutionary Computation · doi:10.1162/evco_a_00109 · Cited by 690
Zhang, X., Tian, Y., Cheng, R., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2600642 · Cited by 660
Two_Arch2: An Improved Two-Archive Algorithm for Many-Objective Optimization
Wang, H., Jiao, L., & Yao, X. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2350987 · Cited by 558
IGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems
Sun, Y., Yen, G. G., & Yi, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2791283 · Cited by 519
A survey on evolutionary computation for complex continuous optimization
Zhan, Z.-H., Shi, L., Tan, K. C., & Zhang, J. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10042-y · Cited by 416
A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization
Asafuddoula, M., Ray, T., & Sarker, R. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2339823 · Cited by 403
Self-citationJiang, S., & Yang, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2592479 · Cited by 376
Fuzzy-Based Pareto Optimality for Many-Objective Evolutionary Algorithms
He, Z., Yen, G. G., & Zhang, J. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2258025 · Cited by 350
Pareto or Non-Pareto: Bi-Criterion Evolution in Multiobjective Optimization
Li, M., Yang, S., & Liu, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504730 · Cited by 309
Objective Reduction in Many-Objective Optimization: Linear and Nonlinear Algorithms
Saxena, D. K., Duro, J. A., Tiwari, A., Deb, K., & Zhang, Q. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2185847 · Cited by 302
A New Decomposition-Based NSGA-II for Many-Objective Optimization
Elarbi, M., Bechikh, S., Gupta, A., Ben Said, L., & Ong, Y.-S. (2018) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2017.2654301 · Cited by 290
A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy
Liu, Y., Gong, D., Sun, J., & Jin, Y. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2638902 · Cited by 271
Many-Objective Software Remodularization Using NSGA-III
Mkaouer, W., Kessentini, M., Shaout, A., Koligheu, P., Bechikh, S., Deb, K., & Ouni, A. (2015) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/2729974 · Cited by 267
A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems
Gong, D., Sun, J., & Miao, Z. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2634625 · Cited by 261
The Emerging "Big Dimensionality"
Zhai, Y., Ong, Y.-S., & Tsang, I. W. (2014) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2014.2326099 · Cited by 257
Metadata
- Authors
- Singh, H. K., Isaacs, A., & Ray, T.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2011-08
- Volume
- 15
- Issue
- 4
- Pages
- 539-556
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2154693991
- Cited by
- 250
- References
- 2
- FWCI
- 13.16
- 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.