The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Multimodal multi-objective optimization: A preliminary study
Abstract
In real world applications, there are many multi-objective optimization problems. Most existing multi-objective optimization algorithms focus on improving the diversity, spread and convergence of the solutions in the objective space. Few works study the distribution of solutions in the decision space. In practical applications, some multi-objective problems have different Pareto sets with the same objective values and these problems are defined as multimodal multi-objective optimization problems. It is of great significance to provide all the Pareto sets for the decision maker. This paper describes the concept of multimodal multi-objective optimization problems in detail. Novel test functions are also designed to judge the performance of different algorithms. Moreover, some existing multi-objective algorithms are tested and compared. Finally, a decision space based niching multi-objective evolutionary algorithm is proposed to solve these problems. The experimental results suggest that existing multi-objective optimization algorithms fail to find all the Pareto sets while the proposed algorithm is able to find almost all the Pareto sets without deteriorating the distribution of solutions in the objective space.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
Multi-objective optimization using genetic algorithms: A tutorial
Konak, A., Coit, D. W., & Smith, A. E. (2006) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2005.11.018 · Cited by 3,440
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
An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
Jong, K. A. D. (1975) · Deep Blue (University of Michigan) · doi:10.7302/10966 · Cited by 1,290
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
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
Cited by
Yue, C., Qu, B., & Liang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2754271 · Cited by 585
Self-citationAn enhanced fast non-dominated solution sorting genetic algorithm for multi-objective problems
Deng, W., Zhang, X., Zhou, Y., Liu, Y., Zhou, X., Chen, H., & Zhao, H. (2022) · Information Sciences · doi:10.1016/j.ins.2021.11.052 · Cited by 462
A 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
Liang, J., Li, Z.-W., Yue, C.-T., Hu, Z., Cheng, H., Liu, Z.-X., & Guo, W.-F. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac254 · Cited by 23
Self-citation
Metadata
- Authors
- Liang, J. J., Yue, C. T., & Qu, B. Y.
- Venue
- 2016 IEEE Congress on Evolutionary Computation (CEC)
- Publisher
- IEEE
- Published
- 2016-07
- Pages
- 2454-2461
- OpenAlex
- W2558610617
- Cited by
- 261
- References
- 19
- FWCI
- 10.82
- Type
- conference paper
- 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: Multimodal multi-objective optimization: A preliminary study. https://app.cochat.ai/papers/10.1109/cec.2016.7744093
- The paper
- Liang, J. J., Yue, C. T., & Qu, B. Y. (2016). Multimodal multi-objective optimization: A preliminary study. 2016 IEEE Congress on Evolutionary Computation (CEC). https://doi.org/10.1109/cec.2016.7744093
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.