The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Preference-Inspired Coevolutionary Algorithms for Many-Objective Optimization
Abstract
The simultaneous optimization of many objectives (in excess of 3), in order to obtain a full and satisfactory set of tradeoff solutions to support a posteriori decision making, remains a challenging problem. The concept of coevolving a family of decision-maker preferences together with a population of candidate solutions is studied here and demonstrated to have promising performance characteristics for such problems. After introducing the concept of the preference-inspired coevolutionary algorithm (PICEA), a realization of this concept, PICEA-g, is systematically compared with four of the best-in-class evolutionary algorithms (EAs); random search is also studied as a baseline approach. The four EAs used in the comparison are a Pareto-dominance relation-based algorithm (NSGA-II), an$\epsilon$-dominance relation-based algorithm [$\epsilon$-multiobjective evolutionary algorithm (MOEA)], a scalarizing function-based algorithm (MOEA/D), and an indicator-based algorithm [hypervolume-based algorithm (HypE)]. It is demonstrated that, for bi-objective problems, all of the multi-objective evolutionary algorithms perform competitively. As the number of objectives increases, PICEA-g and HypE, which have comparable performance, tend to outperform NSGA-II,$\epsilon$-MOEA, and MOEA/D. All the algorithms outperformed random search.
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,328
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
Performance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330
Brest, J., Greiner, S., Boskovic, B., Mernik, M., & Zumer, V. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.872133 · Cited by 3,077
Nonlinear Multiobjective Optimization
Mardle, S., & Miettinen, K. M. (2000) · The Journal of the Operational Research Society · doi:10.2307/254267 · Cited by 3,049
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
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
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
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
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
Nonparametric Statistical Methods
Ramsey, P. H. (2000) · Technometrics · doi:10.1080/00401706.2000.10486020 · Cited by 1,673
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
Encyclopedia of measurement and statistics
(2007) · Choice Reviews Online · doi:10.5860/choice.44-4214 · Cited by 1,385
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
Self-citationThe 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
The Box Plot: A Simple Visual Method to Interpret Data
Williamson, D. F., Parker, R. A., & Kendrick, J. S. (1989) · Annals of Internal Medicine · doi:10.7326/0003-4819-110-11-916 · Cited by 702
Deb, K., Mohan, M., & Mishra, S. (2005) · Evolutionary Computation · doi:10.1162/106365605774666895 · Cited by 637
The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances
Zhang, Q., Liu, W., & Li, H. (2009) · 2009 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2009.4982949 · Cited by 624
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
On measuring multiobjective evolutionary algorithm performance
Van Veldhuizen, D. A., & Lamont, G. B. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870296 · Cited by 512
Jaszkiewicz, A. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802873 · Cited by 474
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
Self-citationPareto-, 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
On the performance assessment and comparison of stochastic multiobjective optimizers
Fonseca, C. M., & Fleming, P. J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_1022 · Cited by 378
Self-citationEvolutionary 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
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 4×
“[33] demonstrated that an approach of this type is able to outperform NSGA-II, the average ranking method [14], and random search on many-objective problems.”
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
Towards a Quick Computation of Well-Spread Pareto-Optimal Solutions
Deb, K., Mohan, M., & Mishra, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36970-8_16 · Cited by 252
Evolutionary many-objective optimisation: an exploratory analysis
Purshouse, R. C., & Fleming, P. J. (2004) · The 2003 Congress on Evolutionary Computation, 2003. CEC '03. · doi:10.1109/cec.2003.1299927 · Cited by 238
Self-citationMultiple 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
Performance comparison of self-adaptive and adaptive differential evolution algorithms
Brest, J., Bošković, B., Greiner, S., Žumer, V., & Maučec, M. S. (2007) · Soft Computing · doi:10.1007/s00500-006-0124-0 · Cited by 226
Hadka, D., & Reed, P. (2012) · Evolutionary Computation · doi:10.1162/evco_a_00053 · Cited by 213
The Automatic Design of Multiobjective Ant Colony Optimization Algorithms
Lopez-Ibanez, M., & Stutzle, T. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2182651 · Cited by 191
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
MSOPS-II: A general-purpose Many-Objective optimiser
Hughes, E. J. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4424985 · Cited by 157
Adapting Weighted Aggregation for Multiobjective Evolution Strategies
Jin, Y., Okabe, T., & Sendho, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44719-9_7 · Cited by 155
Ideal Evaluation from Coevolution
de Jong, E. D., & Pollack, J. B. (2004) · Evolutionary Computation · doi:10.1162/106365604773955139 · Cited by 143
Simultaneous use of different scalarizing functions in MOEA/D
Ishibuchi, H., Sakane, Y., Tsukamoto, N., & Nojima, Y. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830577 · Cited by 135
Nonlinear System Identification Using Coevolution of Models and Tests
Bongard, J., & Lipson, H. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.850293 · Cited by 130
Ishibuchi, H., Tsukamoto, N., Hitotsuyanagi, Y., & Nojima, Y. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389225 · Cited by 84
Behavior 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
Preference-Driven Co-evolutionary Algorithms Show Promise for Many-Objective Optimisation
Purshouse, R. C., Jalbă, C., & Fleming, P. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19893-9_10 · Cited by 53
Self-citation
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
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
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 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
Metadata
- Authors
- Wang, R., Purshouse, R. C., & Fleming, P. J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2013-08
- Volume
- 17
- Issue
- 4
- Pages
- 474-494
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W1968219458
- Cited by
- 406
- References
- 49
- FWCI
- 22.06
- 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.