The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A multi-objective particle swarm optimizer based on decomposition
Abstract
The simplicity and success of particle swarm optimization (PSO) algorithms, has motivated researchers to extend the use of these techniques to the multi-objective optimization field. This paper presents a multi-objective particle swarm optimization (MOPSO) algorithm based on a decomposition approach, which is intended for solving continuous and unconstrained multi-objective optimization problems (MOPs). The proposed decomposition-based multi-objective particle swarm optimizer (dMOPSO), updates the position of each particle using a set of solutions considered as the global best according to the decomposition approach. dMOPSO is mainly characterized by the use of a memory reinitialization process which aims to provide diversity to the swarm. Our proposed approach is compared with respect to two decomposition-based multi-objective evolutionary algorithms (MOEAs) which are representative of the state-of-the-art in the area. Our results indicate that our proposed approach is competitive and it outperforms the two MOEAs with respect to which it was compared in most of the test problems adopted.
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
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
Cited by
Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]
Tian, Y., Cheng, R., Zhang, X., & Jin, Y. (2017) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2017.2742868 · Cited by 2,777
A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization
Yuan, Y., Xu, H., Wang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2420112 · Cited by 752
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
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
A competitive mechanism based multi-objective particle swarm optimizer with fast convergence
Zhang, X., Zheng, X., Cheng, R., Qiu, J., & Jin, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2017.10.037 · Cited by 425
Metadata
- Authors
- Zapotecas Martínez, S., & Coello Coello, C. A.
- Venue
- Proceedings of the 13th annual conference on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2011-07-12
- Pages
- 69-76
- OpenAlex
- W2068411105
- Cited by
- 246
- References
- 1
- FWCI
- 7.46
- 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: A multi-objective particle swarm optimizer based on decomposition. https://app.cochat.ai/papers/10.1145/2001576.2001587
- The paper
- Zapotecas Martínez, S., & Coello Coello, C. A. (2011). A multi-objective particle swarm optimizer based on decomposition. Proceedings of the 13th annual conference on Genetic and evolutionary computation. https://doi.org/10.1145/2001576.2001587
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.