The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
A Multiobjective Particle Swarm Optimizer Using Ring Topology for Solving Multimodal Multiobjective Problems
Abstract
This paper presents a new particle swarm optimizer for solving multimodal multiobjective optimization problems which may have more than one Pareto-optimal solution corresponding to the same objective function value. The proposed method features an index-based ring topology to induce stable niches that allow the identification of a larger number of Pareto-optimal solutions, and adopts a special crowding distance concept as a density metric in the decision and objective spaces. The algorithm is shown to not only locate and maintain a larger number of Pareto-optimal solutions, but also to obtain good distributions in both the decision and objective spaces. In addition, new multimodal multiobjective optimization test functions and a novel performance indicator are designed for the purpose of assessing the performance of the proposed algorithms. An effectiveness validation study is carried out comparing the proposed method with five other algorithms using the benchmark functions to prove its effectiveness.
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
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
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Clerc, M., & Kennedy, J. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.985692 · Cited by 9,017
(2019) · Handbook of Machine Learning · doi:10.1142/9789811205675_0004 · Cited by 6,270
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
Population structure and particle swarm performance
Kennedy, J., & Mendes, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004493 · Cited by 1,586
Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
Coello Coello, C. A., & Reyes-Sierra, M. (2006) · International Journal of Computational Intelligence Research · doi:10.5019/j.ijcir.2006.68 · Cited by 1,365
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
Efficient Large-Scale Multiobjective Optimization Based on a Competitive Swarm Optimizer
Tian, Y., Zheng, X., Zhang, X., & Jin, Y. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2906383 · Cited by 480
An 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
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
Variable-Length Particle Swarm Optimization for Feature Selection on High-Dimensional Classification
Tran, B., Xue, B., & Zhang, M. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869405 · Cited by 333
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
Particle Swarm Optimisation: A Historical Review Up to the Current Developments
Freitas, D., Lopes, L. G., & Morgado-Dias, F. (2020) · Entropy · doi:10.3390/e22030362 · Cited by 310
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
- Yue, C., Qu, B., & Liang, J.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2018-10
- Volume
- 22
- Issue
- 5
- Pages
- 805-817
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2758008099
- Cited by
- 585
- References
- 27
- FWCI
- 18.15
- 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.