The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems
Abstract
Interval many-objective optimization problems (IMaOPs), involving more than three objectives and at least one subjected to interval uncertainty, are ubiquitous in real-world applications. However, there have been very few effective methods for solving these problems. In this paper, we proposed a set-based genetic algorithm to effectively solve them. The original optimization problem was first transformed into a deterministic bi-objective problem, where new objectives are hyper-volume and imprecision. A set-based Pareto dominance relation was then defined to modify the fast nondominated sorting approach in NSGA-II. Additionally, set-based evolutionary schemes were suggested. Finally, our method was empirically evaluated on 39 benchmark IMaOPs as well as a car cab design problem and compared with two typical methods. The numerical results demonstrated the superiority of our method and indicated that a tradeoff approximate front between convergence and uncertainty can be produced.
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
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
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Introduction to Interval Analysis
Moore, R. E., Kearfott, R. B., & Cloud, M. J. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717716 · Cited by 2,591
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
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
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
Scalable multi-objective optimization test problems
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007032 · Cited by 1,627
Cited by
Atom search optimization and its application to solve a hydrogeologic parameter estimation problem
Zhao, W., Wang, L., & Zhang, Z. (2019) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.08.030 · Cited by 699
Rathore, M. M., Shah, S. A., Shukla, D., Bentafat, E., & Bakiras, S. (2021) · IEEE Access · doi:10.1109/access.2021.3060863 · Cited by 616
AI Models for Green Communications Towards 6G
Mao, B., Tang, F., Kawamoto, Y., & Kato, N. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3130901 · Cited by 300
A hybrid particle swarm optimization algorithm using adaptive learning strategy
Wang, F., Zhang, H., Li, K., Lin, Z., Yang, J., & Shen, X.-L. (2018) · Information Sciences · doi:10.1016/j.ins.2018.01.027 · Cited by 284
An Optimization Method for Intrusion Detection Classification Model Based on Deep Belief Network
Wei, P., Li, Y., Zhang, Z., Hu, T., Li, Z., & Liu, D. (2019) · IEEE Access · doi:10.1109/access.2019.2925828 · Cited by 144
Metadata
- Authors
- Gong, D., Sun, J., & Miao, Z.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2018-02
- Volume
- 22
- Issue
- 1
- Pages
- 47-60
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2558150887
- Cited by
- 261
- References
- 25
- FWCI
- 24.71
- 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 Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems. https://app.cochat.ai/papers/10.1109/tevc.2016.2634625
- The paper
- Gong, D., Sun, J., & Miao, Z. (2018). A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2016.2634625
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.