The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the Evolutionary Optimization of Many Conflicting Objectives
Abstract
This study explores the utility of multiobjective evolutionary algorithms (using standard Pareto ranking and diversity-promoting selection mechanisms) for solving optimization tasks with many conflicting objectives. Optimizer behavior is assessed for a grid of mutation and recombination operator configurations. Performance maps are obtained for the dual aims of proximity to, and distribution across, the optimal tradeoff surface. Performance sweet-spots for both variation operators are observed to contract as the number of objectives is increased. Classical settings for recombination are shown to be suitable for small numbers of objectives but correspond to very poor performance for higher numbers of objectives, even when large population sizes are used. Explanations for this behavior are offered via the concepts of dominance resistance and active diversity promotion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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
Constraint Handling in Multiobjective Evolutionary Optimization
Woldesenbet, Y. G., Yen, G. G., & Tessema, B. G. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009032 · Cited by 420
Overcoming the bootstrap problem in evolutionary robotics using behavioral diversity
Mouret, J.-B., & Doncieux, S. (2009) · 2009 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2009.4983077 · Cited by 106
Metadata
- Authors
- Purshouse, R. C., & Fleming, P. J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2007-12
- Volume
- 11
- Issue
- 6
- Pages
- 770-784
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2133787071
- Cited by
- 451
- References
- 1
- FWCI
- 14.08
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Evolutionary Optimization of Many Conflicting Objectives. https://app.cochat.ai/papers/10.1109/tevc.2007.910138
- The paper
- Purshouse, R. C., & Fleming, P. J. (2007). On the Evolutionary Optimization of Many Conflicting Objectives. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2007.910138
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.
