The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
A Multimodal Multiobjective Evolutionary Algorithm Using Two-Archive and Recombination Strategies
Abstract
There have been few researches on solving multimodal multiobjective optimization problems, whereas they are commonly seen in real-world applications but difficult for the existing evolutionary optimizers. In this paper, we propose a novel multimodal multiobjective evolutionary algorithm using two-archive and recombination strategies. In the proposed algorithm, the properties of decision variables and the relationships among them are analyzed at first to guide the evolutionary search. Then, a general framework using two archives, i.e., the convergence and the diversity archives, is adopted to cooperatively solve these problems. Moreover, the diversity archive simultaneously employs a clustering strategy to guarantee diversity in the objective space and a niche-based clearing strategy to promote the same in the decision space. At the end of evolution process, solutions in the convergence and the diversity archives are recombined to obtain a large number of multiple Pareto optimal solutions. In addition, a set of benchmark test functions and a performance metric are designed for multimodal multiobjective optimization. The proposed algorithm is empirically compared with two state-of-the-art evolutionary algorithms on these test functions. The comparative results demonstrate that the overall performance of the proposed algorithm is significantly superior to the competing algorithms.
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
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 17,328
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
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
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
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
Deb, K. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.3.205 · Cited by 1,451
The balance between proximity and diversity in multiobjective evolutionary algorithms
Bosman, P. A. N., & Thierens, D. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810761 · Cited by 1,154
Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition
Zhang, Q., Zhou, A., Zhao, S.-Z., et al. (2009) · Cited by 951
Zhang, X., Tian, Y., Cheng, R., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2600642 · Cited by 660
A clearing procedure as a niching method for genetic algorithms
Petrowski, A. (1996) · Proceedings of IEEE International Conference on Evolutionary Computation ICEC-96 · doi:10.1109/icec.1996.542703 · Cited by 630
Yue, C., Qu, B., & Liang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2754271 · Cited by 585
Two_Arch2: An Improved Two-Archive Algorithm for Many-Objective Optimization
Wang, H., Jiao, L., & Yao, X. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2350987 · Cited by 558
Ma, X., Liu, F., Qi, Y., Wang, X., Li, L., Jiao, L., Yin, M., & Gong, M. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2455812 · Cited by 523
On measuring multiobjective evolutionary algorithm performance
Van Veldhuizen, D. A., & Lamont, G. B. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870296 · Cited by 512
Jaszkiewicz, A. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.802873 · Cited by 474
Multimodal optimization using crowding-based differential evolution
Thomsen, R. (2005) · Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) · doi:10.1109/cec.2004.1331058 · Cited by 438
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
Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization
Deb, K., & Tiwari, S. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.06.042 · Cited by 399
Zhou, A., Zhang, Q., & Jin, Y. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2021467 · Cited by 362
Seeking Multiple Solutions: An Updated Survey on Niching Methods and Their Applications
Li, X., Epitropakis, M. G., Deb, K., & Engelbrecht, A. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2638437 · Cited by 339
A Many-Objective Evolutionary Algorithm Using A One-by-One Selection Strategy
Liu, Y., Gong, D., Sun, J., & Jin, Y. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2638902 · Cited by 271
Self-citationMultimodal multi-objective optimization: A preliminary study
Liang, J. J., Yue, C. T., & Qu, B. Y. (2016) · 2016 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2016.7744093 · Cited by 261
Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns
Han, Y., Gong, D., Jin, Y., & Pan, Q. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2771213 · Cited by 228
Self-citationOn the convergence of a class of estimation of distribution algorithms
Zhang, Q., & Muhlenbein, H. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.820663 · Cited by 224
A Cluster-Based Differential Evolution With Self-Adaptive Strategy for Multimodal Optimization
Gao, W., Yen, G. G., & Liu, S. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2282491 · Cited by 216
Self-citationWang, Y., Li, H.-X., Yen, G. G., & Song, W. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2337117 · Cited by 198
Self-citationMeasurement of Population Diversity
Morrison, R. W., & Jong, K. A. D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46033-0_3 · Cited by 153
Many-Objective Evolutionary Algorithms Based on Coordinated Selection Strategy
He, Z., & Yen, G. G. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2598687 · Cited by 146
Self-citationMany-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-citationEvolutionary Optimization: Pitfalls and Booby Traps
Weise, T., Chiong, R., & Tang, K. (2012) · Journal of Computer Science and Technology · doi:10.1007/s11390-012-1274-4 · Cited by 127
Ishibuchi, H., Akedo, N., & Nojima, Y. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001666 · Cited by 111
Hu, W., Yen, G. G., & Luo, G. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2548239 · Cited by 77
Self-citationEctropy of diversity measures for populations in Euclidean space
Lačević, B., & Amaldi, E. (2011) · Information Sciences · doi:10.1016/j.ins.2010.12.004 · Cited by 27
Cited by
Evolutionary Large-Scale Multi-Objective Optimization: A Survey
Tian, Y., Si, L., Zhang, X., Cheng, R., He, C., Tan, K. C., & Jin, Y. (2022) · ACM Computing Surveys · doi:10.1145/3470971 · Cited by 401
Hua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
Metadata
- Authors
- Liu, Y., Yen, G. G., & Gong, D.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2019-08
- Volume
- 23
- Issue
- 4
- Pages
- 660-674
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2899519149
- Cited by
- 325
- References
- 38
- FWCI
- 11.72
- 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.