The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
IGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems
Open accessAbstract
Inverted generational distance (IGD) has been widely considered as a reliable performance indicator to concurrently quantify the convergence and diversity of multiobjective and many-objective evolutionary algorithms. In this paper, an IGD indicator-based evolutionary algorithm for solving many-objective optimization problems (MaOPs) has been proposed. Specifically, the IGD indicator is employed in each generation to select the solutions with favorable convergence and diversity. In addition, a computationally efficient dominance comparison method is designed to assign the rank values of solutions along with three newly proposed proximity distance assignments. Based on these two designs, the solutions are selected from a global view by linear assignment mechanism to concern the convergence and diversity simultaneously. In order to facilitate the accuracy of the sampled reference points for the calculation of IGD indicator, we also propose an efficient decomposition-based nadir point estimation method for constructing the Utopian Pareto front (PF) which is regarded as the best approximate PF for real-world MaOPs at the early stage of the evolution. To evaluate the performance, a series of experiments is performed on the proposed algorithm against a group of selected state-of-the-art many-objective optimization algorithms over optimization problems with 8-, 15-, and 20-objective. Experimental results measured by the chosen performance metrics indicate that the proposed algorithm is very competitive in addressing MaOPs.
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
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
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
Das, I., & Dennis, J. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496307510 · Cited by 2,654
A review of multiobjective test problems and a scalable test problem toolkit
Huband, S., Hingston, P., Barone, L., & While, L. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.861417 · Cited by 2,090
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Bader, J., & Zitzler, E. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00009 · Cited by 2,081
Scalable Test Problems for Evolutionary Multiobjective Optimization
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_6 · Cited by 2,010
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
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Laumanns, M., Thiele, L., Deb, K., & Zitzler, E. (2002) · Evolutionary Computation · doi:10.1162/106365602760234108 · Cited by 1,487
Fonseca, C. M., & Fleming, P. J. (1998) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/3468.650319 · Cited by 1,234
Linear programming with multiple objective functions: Step method (stem)
Benayoun, R., de Montgolfier, J., Tergny, J., & Laritchev, O. (1971) · Mathematical Programming · doi:10.1007/bf01584098 · Cited by 923
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
Covariance Matrix Adaptation for Multi-objective Optimization
Igel, C., Hansen, N., & Roth, S. (2007) · Evolutionary Computation · doi:10.1162/evco.2007.15.1.1 · Cited by 788
A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization
Yuan, Y., Xu, H., Wang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2420112 · Cited by 752
Modified Distance Calculation in Generational Distance and Inverted Generational Distance
Ishibuchi, H., Masuda, H., Tanigaki, Y., & Nojima, Y. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-15892-1_8 · Cited by 739
Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization
Li, M., Yang, S., & Liu, X. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2262178 · Cited by 714
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Emmerich, M., Beume, N., & Naujoks, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31880-4_5 · Cited by 604
Ma, X., Liu, F., Qi, Y., Wang, X., Li, L., Jiao, L., Yin, M., & Gong, M. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2455812 · Cited by 523
Performance Scaling of Multi-objective Evolutionary Algorithms
Khare, V., Yao, X., & Deb, K. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36970-8_27 · Cited by 453
On the Evolutionary Optimization of Many Conflicting Objectives
Purshouse, R. C., & Fleming, P. J. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.910138 · Cited by 451
Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization
Wagner, T., Beume, N., & Naujoks, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70928-2_56 · Cited by 425
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
Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers
Yuan, Y., Xu, H., Wang, B., Zhang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2443001 · Cited by 400
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
Stable Matching-Based Selection in Evolutionary Multiobjective Optimization
Li, K., Zhang, Q., Kwong, S., Li, M., & Wang, R. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2293776 · Cited by 357
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
Self-citationA New Evolutionary Algorithm for Solving Many-Objective Optimization Problems
Zou, X., Chen, Y., Liu, M., & Kang, L. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.926329 · Cited by 326
MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColony
Ke, L., Zhang, Q., & Battiti, R. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2231860 · Cited by 306
An Investigation on Preference Order Ranking Scheme for Multiobjective Evolutionary Optimization
di Pierro, F., Khu, S.-T., & Savi, D. A. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.876362 · Cited by 280
Improving the Hungarian assignment algorithm
Jonker, R., & Volgenant, T. (1986) · Operations Research Letters · doi:10.1016/0167-6377(86)90073-8 · Cited by 274
Diversity Management in Evolutionary Many-Objective Optimization
Adra, S. F., & Fleming, P. J. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2058117 · Cited by 262
Singh, H. K., Isaacs, A., & Ray, T. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2093579 · Cited by 250
Interrelationship-Based Selection for Decomposition Multiobjective Optimization
Li, K., Kwong, S., Zhang, Q., & Deb, K. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2365354 · Cited by 159
A Many-Objective Evolutionary Algorithm With Enhanced Mating and Environmental Selections
Cheng, J., Yen, G. G., & Zhang, G. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2424921 · Cited by 138
Self-citationIshibuchi, H., Hitotsuyanagi, Y., Tsukamoto, N., & Nojima, Y. (2010) · Springer eBooks · doi:10.1007/978-3-642-15871-1_10 · Cited by 127
Towards estimating nadir objective vector using evolutionary approaches
Deb, K., Chaudhuri, S., & Miettinen, K. (2006) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1143997.1144113 · Cited by 80
A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming
Korhonen, P., Salo, S., & Steuer, R. E. (1997) · Operations Research · doi:10.1287/opre.45.5.751 · Cited by 77
Chikumbo, O., Goodman, E. D., & Deb, K. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256170 · Cited by 66
Reference line-based Estimation of Distribution Algorithm for many-objective optimization
Sun, Y., Yen, G. G., & Zhang, Y. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.06.021 · Cited by 26
Self-citation
Cited by
Automatically Designing CNN Architectures Using the Genetic Algorithm for Image Classification
Sun, Y., Xue, B., Zhang, M., Yen, G. G., & Lv, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2983860 · Cited by 870
Self-citationA Survey on Evolutionary Neural Architecture Search
Liu, Y., Sun, Y., Xue, B., Zhang, M., Yen, G. G., & Tan, K. C. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3100554 · Cited by 644
Self-citationThe Colony Predation Algorithm
Tu, J., Chen, H., Wang, M., & Gandomi, A. H. (2021) · Journal of Bionic Engineering · doi:10.1007/s42235-021-0050-y · Cited by 571
A Survey on Evolutionary Constrained Multiobjective Optimization
Liang, J., Ban, X., Yu, K., Qu, B., Qiao, K., Yue, C., Chen, K., & Tan, K. C. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2022.3155533 · Cited by 438
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
Metadata
- Authors
- Sun, Y., Yen, G. G., & Yi, Z.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2019-04
- Volume
- 23
- Issue
- 2
- Pages
- 173-187
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2783781089
- Cited by
- 519
- References
- 43
- FWCI
- 25.74
- Type
- journal article
- Language
- en
- Open access
- green
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.