The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Evolutionary many-objective optimisation: Many once or one many?
Abstract
Multi-objective evolutionary algorithms are widely established and well developed for problems with two or three objectives. However, it is known that for many-objective optimisation, where there are typically more than three objectives, the algorithms applying Pareto optimality as a ranking metric may loose their effectiveness. This paper compares three different approaches to generating Pareto surfaces on both multi and many objective problems. The first approach is using an established Pareto ranking method (NSGA II), the second combines multiple single objective optimisations in a single run (MSOPS), and the third uses multiple runs of a single objective optimiser. The results demonstrate that much can be gained by generating the entire Pareto set in a single run, when compared to repeated single objective optimisations. It is also clear that NSGA II loses its effectiveness as the problem dimensionality increases - it is more effective to use many single objective optimisations than a Pareto-ranking based optimiser on many-objective problems. Ultimately though, "many once or once many" is dependent on algorithm choice, not problem scale
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
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_83 · Cited by 5,289
Price, K. V. (2004) · Cited by 3,344
Storn, R. (1995) · Medical Entomology and Zoology · Cited by 2,800
An updated survey of GA-based multiobjective optimization techniques
Coello, C. A. (2000) · ACM Computing Surveys · doi:10.1145/358923.358929 · Cited by 773
GA-based decision support system for multicriteria optimization
Tanaka, M., Watanabe, H., Furukawa, Y., & Tanino, T. (2002) · 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century · doi:10.1109/icsmc.1995.537993 · Cited by 248
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
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
Self-citation
Cited by
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
Deb, K., & Deb, K. (2014) · Search Methodologies · doi:10.1007/978-1-4614-6940-7_15 · Cited by 1,248
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
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA
Bandyopadhyay, S., Saha, S., Maulik, U., & Deb, K. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.900837 · Cited by 852
Metadata
- Authors
- Hughes, E. J.
- Venue
- 2005 IEEE Congress on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2005-12-13
- Volume
- 1
- Pages
- 222-227
- OpenAlex
- W1987958230
- Cited by
- 360
- References
- 9
- FWCI
- 12.48
- Type
- conference paper
- 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: Evolutionary many-objective optimisation: Many once or one many? https://app.cochat.ai/papers/10.1109/cec.2005.1554688
- The paper
- Hughes, E. J. (2005). Evolutionary many-objective optimisation: Many once or one many? 2005 IEEE Congress on Evolutionary Computation. https://doi.org/10.1109/cec.2005.1554688
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.