The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives
Abstract
Traditionally, evolutionary algorithms (EAs) have been systematically developed to solve mono-, multi-, and many-objective optimization problems, in this order. Despite some efforts in unifying different types of mono-objective evolutionary and non-EAs, researchers are not interested enough in unifying all three types of optimization problems together. Such a unified algorithm will allow users to work with a single software enabling one-time implementation of solution representation, operators, objectives, and constraints formulations across several objective dimensions. For the first time, we propose a unified evolutionary optimization algorithm for solving all three classes of problems specified above, based on the recently proposed elitist, guided nondominated sorting procedure, developed for solving many-objectives problems. Using a new niching-based selection procedure, our proposed unified algorithm automatically degenerates to an efficient equivalent population-based algorithm for each class. No extra parameters are needed. Extensive simulations are performed on unconstrained and constrained test problems having single-, two-, multi-, and many-objectives and on two engineering optimization design problems. Performance of the unified approach is compared to suitable population-based counterparts at each dimensional level. Results amply demonstrate the merit of our proposed unified approach and motivate similar studies for a richer understanding of the development of optimization algorithms.
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
Self-citationMOEA/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
Cited by
Pymoo: Multi-Objective Optimization in Python
Blank, J., & Deb, K. (2020) · IEEE Access · doi:10.1109/access.2020.2990567 · Cited by 2,344
Self-citationPerformance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes
Ishibuchi, H., Setoguchi, Y., Masuda, H., & Nojima, Y. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2587749 · Cited by 592
A Survey of Multiobjective Evolutionary Algorithms based on Decomposition
Trivedi, A., Srinivasan, D., Sanyal, K., & Ghosh, A. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2608507 · Cited by 549
Metadata
- Authors
- Seada, H., & Deb, K.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2016-06
- Volume
- 20
- Issue
- 3
- Pages
- 358-369
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2417793772
- Cited by
- 172
- References
- 2
- FWCI
- 10.31
- 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: A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives. https://app.cochat.ai/papers/10.1109/tevc.2015.2459718
- The paper
- Seada, H., & Deb, K. (2016). A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2015.2459718
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.