The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization
Open accessAbstract
It is commonly accepted that Pareto-based evolutionary multiobjective optimization (EMO) algorithms encounter difficulties in dealing with many-objective problems. In these algorithms, the ineffectiveness of the Pareto dominance relation for a high-dimensional space leads diversity maintenance mechanisms to play the leading role during the evolutionary process, while the preference of diversity maintenance mechanisms for individuals in sparse regions results in the final solutions distributed widely over the objective space but distant from the desired Pareto front. Intuitively, there are two ways to address this problem: 1) modifying the Pareto dominance relation and 2) modifying the diversity maintenance mechanism in the algorithm. In this paper, we focus on the latter and propose a shift-based density estimation (SDE) strategy. The aim of our study is to develop a general modification of density estimation in order to make Pareto-based algorithms suitable for many-objective optimization. In contrast to traditional density estimation that only involves the distribution of individuals in the population, SDE covers both the distribution and convergence information of individuals. The application of SDE in three popular Pareto-based algorithms demonstrates its usefulness in handling many-objective problems. Moreover, an extensive comparison with five state-of-the-art EMO algorithms reveals its competitiveness in balancing convergence and diversity of solutions. These findings not only show that SDE is a good alternative to tackle many-objective problems, but also present a general extension of Pareto-based algorithms in many-objective optimization.
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
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
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
GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
Fonseca, C. M., & Fleming, P. J. (1993) · international conference on Genetic algorithms · Cited by 4,301
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
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
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
Multiobjective 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
How to Solve It: Modern Heuristics
Michalewicz, Z., & Fogel, D. B. (2000) · Springer eBooks · doi:10.1007/978-3-662-04131-4 · Cited by 2,207
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
SMS-EMOA: Multiobjective selection based on dominated hypervolume
Beume, N., Naujoks, B., & Emmerich, M. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.008 · Cited by 2,048
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
Evolutionary Optimization in Uncertain Environments—A Survey
Jin, Y., & Branke, J. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.846356 · Cited by 1,572
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
Evolutionary multi-objective optimization: a historical view of the field
Coello Coello, C. A. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2006.1597059 · Cited by 1,446
PESA-II: region-based selection in evolutionary multiobjective optimization
Corne, D., Jerram, N. R., Knowles, J. D., & Oates, M. J. (2001) · Genetic and Evolutionary Computation Conference (GECCO) · Cited by 1,249
The balance between proximity and diversity in multiobjective evolutionary algorithms
Bosman, P. A. N., & Thierens, D. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810761 · Cited by 1,154
SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization
Zitzler, E., Giannakoglou, K., Tsahalis, D., Periaux, J., Papailiou, K., (eds, T. F., Ler, E. Z., Laumanns, M., & Thiele, L. (2002) · Cited by 1,010
Evolutionary many-objective optimization: A short review
Ishibuchi, H., Tsukamoto, N., & Nojima, Y. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4631121 · Cited by 914
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
Self-citationCovariance 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
Deb, K., Mohan, M., & Mishra, S. (2005) · Evolutionary Computation · doi:10.1162/106365605774666895 · Cited by 637
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
Preference-Inspired Coevolutionary Algorithms for Many-Objective Optimization
Wang, R., Purshouse, R. C., & Fleming, P. J. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2204264 · Cited by 406
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
Many-Objective Optimization: An Engineering Design Perspective
Fleming, P. J., Purshouse, R. C., & Lygoe, R. J. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31880-4_2 · Cited by 372
Evolutionary many-objective optimisation: Many once or one many?
Hughes, E. J. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554688 · Cited by 360
Yang, S., & Li, C. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2046667 · Cited by 344
Self-citationA fuzzy definition of "optimality" for many-criteria optimization problems
Farina, M., & Amato, P. (2004) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2004.824873 · Cited by 335
Quality Assessment of Pareto Set Approximations
Zitzler, E., Knowles, J., & Thiele, L. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88908-3_14 · Cited by 313
Multiobjective Evolutionary Algorithms and Applications
(2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-132-6 · Cited by 292
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
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 5×
“the search toward the desired direction [12], [43].”
BackgroundMethodInfluentialSubstitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems
Köppen, M., & Yoshida, K. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70928-2_55 · Cited by 263
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
Multiple single objective pareto sampling
Hughes, E. J. (2004) · The 2003 Congress on Evolutionary Computation, 2003. CEC '03. · doi:10.1109/cec.2003.1299427 · Cited by 234
Hadka, D., & Reed, P. (2012) · Evolutionary Computation · doi:10.1162/evco_a_00053 · Cited by 213
Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation
Yen, G. G., & Lu, H. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810068 · Cited by 201
Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms
Murata, T., Ishibuchi, H., & Gen, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44719-9_6 · Cited by 193
Evolutionary many-objective optimization by NSGA-II and MOEA/D with large populations
Ishibuchi, H., Sakane, Y., Tsukamoto, N., & Nojima, Y. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346628 · Cited by 169
Schutze, O., Lara, A., & Coello, C. A. C. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2064321 · Cited by 159
Ishibuchi, H., Hitotsuyanagi, Y., Tsukamoto, N., & Nojima, Y. (2010) · Springer eBooks · doi:10.1007/978-3-642-15871-1_10 · Cited by 127
Ishibuchi, H., Tsukamoto, N., Hitotsuyanagi, Y., & Nojima, Y. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389225 · Cited by 84
A Comparative Study on Evolutionary Algorithms for Many-Objective Optimization
Li, M., Yang, S., Liu, X., & Shen, R. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37140-0_22 · Cited by 69
Self-citationBehavior of EMO algorithms on many-objective optimization problems with correlated objectives
Ishibuchi, H., Akedo, N., Ohyanagi, H., & Nojima, Y. (2011) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2011.5949788 · Cited by 68
Study of preference relations in many-objective optimization
Jáimes, A. L., & Coello, C. A. C. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1569986 · Cited by 66
Enhancing Diversity for Average Ranking Method in Evolutionary Many-Objective Optimization
Li, M., Zheng, J., Li, K., Yuan, Q., & Shen, R. (2010) · Springer eBooks · doi:10.1007/978-3-642-15844-5_65 · Cited by 34
Self-citationA grid-based fitness strategy for evolutionary many-objective optimization
Li, M., Zheng, J., Shen, R., Li, K., & Yuan, Q. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830570 · Cited by 33
Self-citationAn Adaptive Divide-and-Conquer Methodology for Evolutionary Multi-criterion Optimisation
Purshouse, R. C., & Fleming, P. J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36970-8_10 · Cited by 23
Effective ranking + speciation = Many-objective optimization
Garza-Fabre, M., Toscano‐Pulido, G., Coello, C. A. C., & Rodríguez-Tello, E. (2011) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2011.5949876 · Cited by 20
IPESA-II: Improved Pareto Envelope-Based Selection Algorithm II
Li, M., Yang, S., Liu, X., & Wang, K. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37140-0_14 · Cited by 18
Self-citationHow entropy-theorems can show that approximating high-dim Pareto-fronts is too hard
Teytaud, O. (2006) · HAL · Cited by 14
Cited by
Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]
Tian, Y., Cheng, R., Zhang, X., & Jin, Y. (2017) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2017.2742868 · Cited by 2,777
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
An 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
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 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
Metadata
- Authors
- Li, M., Yang, S., & Liu, X.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2014-06
- Volume
- 18
- Issue
- 3
- Pages
- 348-365
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2128357515
- Cited by
- 714
- References
- 58
- FWCI
- 22.66
- Type
- journal article
- Language
- en
- Open access
- bronze
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.