The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Decomposition of a Multiobjective Optimization Problem Into a Number of Simple Multiobjective Subproblems
Abstract
This letter suggests an approach for decomposing a multiobjective optimization problem (MOP) into a set of simple multiobjective optimization subproblems. Using this approach, it proposes MOEA/D-M2M, a new version of multiobjective optimization evolutionary algorithm-based decomposition. This proposed algorithm solves these subproblems in a collaborative way. Each subproblem has its own population and receives computational effort at each generation. In such a way, population diversity can be maintained, which is critical for solving some MOPs. Experimental studies have been conducted to compare MOEA/D-M2M with classic MOEA/D and NSGA-II. This letter argues that population diversity is more important than convergence in multiobjective evolutionary algorithms for dealing with some MOPs. It also explains why MOEA/D-M2M performs better.
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,326
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 2×
“A number of multiobjective optimization evolutionary algorithms (MOEAs) have been developed for finding a set of solutions to approximate the PF in a single run [2]–[6].”
BackgroundMethodSelf-citationNonlinear Multiobjective Optimization
Miettinen, K. (1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5563-6 · Cited by 4,710
Nonlinear Multiobjective Optimization
Mardle, S., & Miettinen, K. M. (2000) · The Journal of the Operational Research Society · doi:10.2307/254267 · Cited by 3,049
Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
Li, H., & Zhang, Q. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.925798 · Cited by 2,543
Self-citationA 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
SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization
Zitzler, E., Giannakoglou, K., Tsahalis, D., Periaux, J., Papailiou, K., (eds, T. F., Ler, E. Z., Laumanns, M., & Thiele, L. (2002) · Cited by 1,010
Considerations in engineering parallel multiobjective evolutionary algorithms
Van Veldhuizen, D. A., Zydallis, J. B., & Lamont, G. B. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810751 · Cited by 260
Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
Mei, Y., Tang, K., & Yao, X. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2051446 · Cited by 216
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 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
An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition
Li, K., Deb, K., Zhang, Q., & Kwong, S. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2373386 · Cited by 1,208
Self-citationTwo-Archive Evolutionary Algorithm for Constrained Multiobjective Optimization
Li, K., Chen, R., Fu, G., & Yao, X. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2855411 · Cited by 752
Tian, Y., Cheng, R., Zhang, X., Cheng, F., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2749619 · Cited by 699
Zhang, X., Tian, Y., Cheng, R., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2600642 · Cited by 660
A Survey of Multiobjective Evolutionary Algorithms based on Decomposition
Trivedi, A., Srinivasan, D., Sanyal, K., & Ghosh, A. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2608507 · Cited by 549
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
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
Fan, Z., Li, W., Cai, X., Huang, H., Fang, Y., You, Y., Mo, J., Wei, C., & Goodman, E. (2019) · Soft Computing · doi:10.1007/s00500-019-03794-x · Cited by 450
A Vector Angle-Based Evolutionary Algorithm for Unconstrained Many-Objective Optimization
Xiang, Y., Zhou, Y., Li, M., & Chen, Z. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2587808 · Cited by 415
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
A Multiobjective Evolutionary Algorithm Using Gaussian Process-Based Inverse Modeling
Cheng, R., Jin, Y., Narukawa, K., & Sendhoff, B. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2395073 · Cited by 377
Jiang, S., & Yang, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2592479 · Cited by 376
Localized Weighted Sum Method for Many-Objective Optimization
Wang, R., Zhou, Z., Ishibuchi, H., Liao, T., & Zhang, T. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2611642 · Cited by 362
Hua, Y., Liu, Q., Hao, K., & Jin, Y. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1003817 · Cited by 346
Ma, L., Huang, M., Yang, S., Wang, R., & Wang, X. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.3041212 · Cited by 318
Difficulty Adjustable and Scalable Constrained Multiobjective Test Problem Toolkit
Fan, Z., Li, W., Cai, X., Li, H., Wei, C., Zhang, Q., Deb, K., & Goodman, E. (2020) · Evolutionary Computation · doi:10.1162/evco_a_00259 · Cited by 308
Self-citationA novel multi-objective particle swarm optimization with multiple search strategies
Lin, Q., Li, J., Du, Z., Chen, J., & Ming, Z. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.06.071 · Cited by 300
A New Decomposition-Based NSGA-II for Many-Objective Optimization
Elarbi, M., Bechikh, S., Gupta, A., Ben Said, L., & Ong, Y.-S. (2018) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2017.2654301 · Cited by 290
Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems
Ishibuchi, H., Akedo, N., & Nojima, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2315442 · Cited by 288
Decomposition-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
Self-citationA Dual-Population-Based Evolutionary Algorithm for Constrained Multiobjective Optimization
Ming, M., Trivedi, A., Wang, R., Srinivasan, D., & Zhang, T. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2021.3066301 · Cited by 258
Adaptive Replacement Strategies for MOEA/D
Wang, Z., Zhang, Q., Zhou, A., Gong, M., & Jiao, L. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2403849 · Cited by 257
Self-citationHandling Constrained Multiobjective Optimization Problems via Bidirectional Coevolution
Liu, Z.-Z., Wang, B.-C., & Tang, K. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3056176 · Cited by 254
A large-scale multiobjective satellite data transmission scheduling algorithm based on SVM+NSGA-II
Zhang, J., Xing, L., Peng, G., Yao, F., & Chen, C. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.100560 · Cited by 48
Energy Efficient and Multi-resource Optimization for Virtual Machine Placement by Improving MOEA/D
Wei, W., Gu, H., Xiao, Z., & Chen, Y. (2025) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2025.3538525 · Cited by 15
“To enhance MOEA/D, MOEA/D-M2M was introduced [36] to transform complex multi-objective problems into simpler multi-objective subproblems.”
Influential
Metadata
- Authors
- Liu, H.-L., Gu, F., & Zhang, Q.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2014-06
- Volume
- 18
- Issue
- 3
- Pages
- 450-455
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2058142975
- Cited by
- 813
- References
- 13
- FWCI
- 37.88
- 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.