The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
A Vector Angle-Based Evolutionary Algorithm for Unconstrained Many-Objective Optimization
Abstract
Taking both convergence and diversity into consideration, this paper suggests a vector angle-based evolutionary algorithm for unconstrained (with box constraints only) many-objective optimization problems. In the proposed algorithm, the maximum-vector-angle-first principle is used in the environmental selection to guarantee the wideness and uniformity of the solution set. With the help of the worse-elimination principle, worse solutions in terms of the convergence (measured by the sum of normalized objectives) are allowed to be conditionally replaced by other individuals. Therefore, the selection pressure toward the Pareto-optimal front is strengthened. The proposed method is compared with other four state-of-the-art many-objective evolutionary algorithms on a number of unconstrained test problems with up to 15 objectives. The experimental results have shown the competitiveness and effectiveness of our proposed algorithm in keeping a good balance between convergence and diversity. Furthermore, it was shown by the results on two problems from practice (with irregular Pareto fronts) that our method significantly outperforms its competitors in terms of both the convergence and diversity of the obtained solution sets. Notably, the new algorithm has the following good properties: 1) it is free from a set of supplied reference points or weight vectors; 2) it has less algorithmic parameters; and 3) the time complexity of the algorithm is low. Given both good performance and nice properties, the suggested algorithm could be an alternative tool when handling optimization problems with more than three objectives.
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
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
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
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
Derrac, J., García, S., Molina, D., & Herrera, F. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.002 · Cited by 5,512
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Handling multiple objectives with particle swarm optimization
Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.826067 · Cited by 4,455
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
Cited by
Tian, Y., Cheng, R., Zhang, X., Su, Y., & Jin, Y. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2866854 · Cited by 384
Hua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
Ma, L., Huang, M., Yang, S., Wang, R., & Wang, X. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3041212 · Cited by 318
Cai, X., Geng, S., Wu, D., Cai, J., & Chen, J. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3040019 · Cited by 273
A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems
Gong, D., Sun, J., & Miao, Z. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2634625 · Cited by 261
Metadata
- Authors
- Xiang, Y., Zhou, Y., Li, M., & Chen, Z.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2017-02
- Volume
- 21
- Issue
- 1
- Pages
- 131-152
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2469950730
- Cited by
- 415
- References
- 54
- FWCI
- 28.58
- 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 Vector Angle-Based Evolutionary Algorithm for Unconstrained Many-Objective Optimization. https://app.cochat.ai/papers/10.1109/tevc.2016.2587808
- The paper
- Xiang, Y., Zhou, Y., Li, M., & Chen, Z. (2017). A Vector Angle-Based Evolutionary Algorithm for Unconstrained Many-Objective Optimization. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2016.2587808
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.