The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy
Abstract
Most existing multiobjective evolutionary algorithms experience difficulties in solving many-objective optimization problems due to their incapability to balance convergence and diversity in the high-dimensional objective space. In this paper, we propose a novel many-objective evolutionary algorithm using a one-by-one selection strategy. The main idea is that in the environmental selection, offspring individuals are selected one by one based on a computationally efficient convergence indicator to increase the selection pressure toward the Pareto optimal front. In the one-by-one selection, once an individual is selected, its neighbors are de-emphasized using a niche technique to guarantee the diversity of the population, in which the similarity between individuals is evaluated by means of a distribution indicator. In addition, different methods for calculating the convergence indicator are examined and an angle-based similarity measure is adopted for effective evaluations of the distribution of solutions in the high-dimensional objective space. Moreover, corner solutions are utilized to enhance the spread of the solutions and to deal with scaled optimization problems. The proposed algorithm is empirically compared with eight state-of-the-art many-objective evolutionary algorithms on 80 instances of 16 benchmark problems. The comparative results demonstrate that the overall performance of the proposed algorithm is superior to the compared algorithms on the optimization problems studied in this paper.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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
Performance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
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
A review of multiobjective test problems and a scalable test problem toolkit
Huband, S., Hingston, P., Barone, L., & While, L. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.861417 · Cited by 2,090
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
Scalable Test Problems for Evolutionary Multiobjective Optimization
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_6 · Cited by 2,010
A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
Cheng, R., Jin, Y., Olhofer, M., & Sendhoff, B. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2519378 · Cited by 1,760
Self-citationThe Use of Reference Objectives in Multiobjective Optimization
Wierzbicki, A. P. (1980) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-48782-8_32 · Cited by 1,057
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 Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization
Zhang, X., Tian, Y., & Jin, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2378512 · Cited by 867
Self-citationMany-Objective Evolutionary Algorithms: A Survey
Li, B., Li, J., Tang, K., & Yao, X. (2015) · ACM Computing Surveys · doi:10.1145/2792984 · Cited by 815
Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization
Li, M., Yang, S., & Liu, X. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2262178 · Cited by 714
MOEA/D with Adaptive Weight Adjustment
Qi, Y., Ma, X., Liu, F., Jiao, L., Sun, J., & Wu, J. (2014) · Evolutionary Computation · doi:10.1162/evco_a_00109 · Cited by 690
Self-citationDeb, K., Mohan, M., & Mishra, S. (2005) · Evolutionary Computation · doi:10.1162/106365605774666895 · Cited by 637
Nonlinear Multiobjective Optimization
Hillermeier, C. (2001) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8280-4 · Cited by 485
A Distance-Based Locally Informed Particle Swarm Model for Multimodal Optimization
Qu, B. Y., Suganthan, P. N., & Das, S. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2203138 · Cited by 421
Li, Y., Tong, S., & Li, T. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2333738 · Cited by 418
Li, Y., Sui, S., & Tong, S. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2518300 · Cited by 417
Balancing Convergence and Diversity in Decomposition-Based Many-Objective Optimizers
Yuan, Y., Xu, H., Wang, B., Zhang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2443001 · Cited by 400
Reference Point Based Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., Sundar, J., Udaya Bhaskara, R. N., & Chaudhuri, S. (2006) · International Journal of Computational Intelligence Research · doi:10.5019/j.ijcir.2006.67 · Cited by 371
Li, Y., & Tong, S. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2536628 · Cited by 356
Fuzzy-Based Pareto Optimality for Many-Objective Evolutionary Algorithms
He, Z., Yen, G. G., & Zhang, J. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2258025 · Cited by 350
An extension of the Electre I method for group decision-making under a fuzzy environment
Hatami‐Marbini, A., & Madjid Tavana, D. (2010) · Omega · doi:10.1016/j.omega.2010.09.001 · Cited by 346
A New Evolutionary Algorithm for Solving Many-Objective Optimization Problems
Zou, X., Chen, Y., Liu, M., & Kang, L. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.926329 · Cited by 326
Zhang, Y., Gong, D.-W., & Ding, Z. (2012) · Information Sciences · doi:10.1016/j.ins.2011.06.004 · Cited by 288
Self-citationDecomposition-Based Algorithms Using Pareto Adaptive Scalarizing Methods
Wang, R., Zhang, Q., & Zhang, T. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2521175 · Cited by 283
Diversity Management in Evolutionary Many-Objective Optimization
Adra, S. F., & Fleming, P. J. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2058117 · Cited by 262
Singh, H. K., Isaacs, A., & Ray, T. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2093579 · Cited by 250
Bi-goal evolution for many-objective optimization problems
Li, M., Yang, S., & Liu, X. (2015) · Artificial Intelligence · doi:10.1016/j.artint.2015.06.007 · Cited by 239
Improved Metaheuristic Based on the R2 Indicator for Many-Objective Optimization
Hernández Gómez, R., & Coello Coello, C. A. (2015) · Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation · doi:10.1145/2739480.2754776 · Cited by 235
Diversity Comparison of Pareto Front Approximations in Many-Objective Optimization
Li, M., Yang, S., & Liu, X. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2310651 · Cited by 172
Adapting Weighted Aggregation for Multiobjective Evolution Strategies
Jin, Y., Okabe, T., & Sendho, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44719-9_7 · Cited by 155
Self-citationConstrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm
Wang, L., Zhang, Q., Zhou, A., Gong, M., & Jiao, L. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2457616 · Cited by 152
Many-objective evolutionary optimization based on reference points
Liu, Y., Gong, D., Sun, X., & Zhang, Y. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.11.009 · Cited by 136
Self-citationSatō, H. (2014) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2576768.2598297 · Cited by 114
Document Clustering Using Concept Space and Cosine Similarity Measurement
Muflikhah, L., & Baharudin, B. (2009) · International Conference on Computer Technology and Development · doi:10.1109/icctd.2009.206 · Cited by 108
A Study on Performance Evaluation Ability of a Modified Inverted Generational Distance Indicator
Ishibuchi, H., Masuda, H., & Nojima, Y. (2015) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2739480.2754792 · Cited by 97
MOEA/D for flowshop scheduling problems
Chang, P., Chen, S.-H., Zhang, Q., & Lin, J. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4630982 · Cited by 84
A fast approximation-guided evolutionary multi-objective algorithm
Wagner, M., & Neumann, F. (2013) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2463372.2463448 · Cited by 80
Sadeghzadeh, K., & Salehi, M. B. (2010) · International Journal of Hydrogen Energy · doi:10.1016/j.ijhydene.2010.07.064 · Cited by 78
Morgan, R., & Gallagher, M. R. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281521 · Cited by 61
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
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
Self-citationHua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
Self-citationA Multimodal Multiobjective Evolutionary Algorithm Using Two-Archive and Recombination Strategies
Liu, Y., Yen, G. G., & Gong, D. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2879406 · Cited by 325
Self-citationA 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
Metadata
- Authors
- Liu, Y., Gong, D., Sun, J., & Jin, Y.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2017-09
- Volume
- 47
- Issue
- 9
- Pages
- 2689-2702
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2570235502
- Cited by
- 271
- References
- 46
- FWCI
- 22.34
- 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
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.