The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Objective Reduction in Many-Objective Optimization: Linear and Nonlinear Algorithms
Abstract
The difficulties faced by existing multiobjective evolutionary algorithms (MOEAs) in handling many-objective problems relate to the inefficiency of selection operators, high computational cost, and difficulty in visualization of objective space. While many approaches aim to counter these difficulties by increasing the fidelity of the standard selection operators, the objective reduction approach attempts to eliminate objectives that are not essential to describe the Pareto-optimal front (POF). If the number of essential objectives is found to be two or three, the problem could be solved by the existing MOEAs. It implies that objective reduction could make an otherwise unsolvable (many-objective) problem solvable. Even when the essential objectives are four or more, the reduced representation of the problem will have favorable impact on the search efficiency, computational cost, and decision-making. Hence, development of generic and robust objective reduction approaches becomes important. This paper presents a principal component analysis and maximum variance unfolding based framework for linear and nonlinear objective reduction algorithms, respectively. The major contribution of this paper includes: 1) the enhancements in the core components of the framework for higher robustness in terms of applicability to a range of problems with disparate degree of redundancy; mechanisms to handle input data that poorly approximates the true POF; and dependence on fewer parameters to minimize the variability in performance; 2) proposition of an error measure to assess the quality of results; 3) sensitivity analysis of the proposed algorithms for the critical parameter involved, and the characteristics of the input data; and 4) study of the performance of the proposed algorithms vis-à-vis dominance relation preservation based algorithms, on a wide range of test problems (scaled up to 50 objectives) and two real-world problems.
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
Statistical Power Analysis for the Behavioral Sciences
Muller, K. (1989) · Technometrics · doi:10.1080/00401706.1989.10488618 · Cited by 99,167
Statistical power analysis for the behavioral sciences
(1990) · Computers, Environment and Urban Systems · doi:10.1016/0198-9715(90)90050-4 · Cited by 65,269
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
Self-citationStatistical Power Analysis for the Behavioral Sciences (2nd ed.).
Lachenbruch, P. A., & Cohen, J. (1989) · Journal of the American Statistical Association · doi:10.2307/2290095 · Cited by 37,395
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
Self-citationNonlinear Component Analysis as a Kernel Eigenvalue Problem
Schölkopf, B., Smola, A., & Müller, K.-R. (1998) · Neural Computation · doi:10.1162/089976698300017467 · Cited by 8,084
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543
Self-citationApproximating 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
Indicator-Based Selection in Multiobjective Search
Zitzler, E., & Künzli, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30217-9_84 · Cited by 2,259
Cited by
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
Self-citationJain, H., & Deb, K. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281534 · Cited by 2,172
Self-citationDeb, K., & Deb, K. (2014) · Search Methodologies · doi:10.1007/978-1-4614-6940-7_15 · Cited by 1,248
Self-citationAn Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition
Li, K., Deb, K., Zhang, Q., & Kwong, S. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2373386 · Cited by 1,208
Self-citationA 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
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
A comprehensive survey on NSGA-II for multi-objective optimization and applications
Ma, H., Zhang, Y., Sun, S., Liu, T., & Shan, Y. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10526-z · Cited by 723
Tian, Y., Cheng, R., Zhang, X., Cheng, F., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2749619 · Cited by 699
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
Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes
Ishibuchi, H., Setoguchi, Y., Masuda, H., & Nojima, Y. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2587749 · Cited by 592
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
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
A Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I
Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., & Coello, C. A. C. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2290086 · Cited by 421
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
Jiang, S., & Yang, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2592479 · Cited by 376
Hua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
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
A survey on multi-objective evolutionary algorithms for many-objective problems
von Lücken, C., Barán, B., & Brizuela, C. (2014) · Computational Optimization and Applications · doi:10.1007/s10589-014-9644-1 · Cited by 297
Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems
Ishibuchi, H., Akedo, N., & Nojima, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2315442 · Cited by 288
Diversity Assessment in Many-Objective Optimization
Wang, H., Jin, Y., & Yao, X. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2550502 · Cited by 274
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
Self-citationA 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
A review on the self and dual interactions between machine learning and optimisation
Song, H., Triguero, I., & Özcan, E. (2019) · Progress in Artificial Intelligence · doi:10.1007/s13748-019-00185-z · Cited by 101
Metadata
- Authors
- Saxena, D. K., Duro, J. A., Tiwari, A., Deb, K., & Zhang, Q.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2013-02
- Volume
- 17
- Issue
- 1
- Pages
- 77-99
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2018712218
- Cited by
- 302
- References
- 40
- FWCI
- 27.15
- 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.