The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
MOEA/D with Adaptive Weight Adjustment
Open accessAbstract
Recently, MOEA/D (multi-objective evolutionary algorithm based on decomposition) has achieved great success in the field of evolutionary multi-objective optimization and has attracted a lot of attention. It decomposes a multi-objective optimization problem (MOP) into a set of scalar subproblems using uniformly distributed aggregation weight vectors and provides an excellent general algorithmic framework of evolutionary multi-objective optimization. Generally, the uniformity of weight vectors in MOEA/D can ensure the diversity of the Pareto optimal solutions, however, it cannot work as well when the target MOP has a complex Pareto front (PF; i.e., discontinuous PF or PF with sharp peak or low tail). To remedy this, we propose an improved MOEA/D with adaptive weight vector adjustment (MOEA/D-AWA). According to the analysis of the geometric relationship between the weight vectors and the optimal solutions under the Chebyshev decomposition scheme, a new weight vector initialization method and an adaptive weight vector adjustment strategy are introduced in MOEA/D-AWA. The weights are adjusted periodically so that the weights of subproblems can be redistributed adaptively to obtain better uniformity of solutions. Meanwhile, computing efforts devoted to subproblems with duplicate optimal solution can be saved. Moreover, an external elite population is introduced to help adding new subproblems into real sparse regions rather than pseudo sparse regions of the complex PF, that is, discontinuous regions of the PF. MOEA/D-AWA has been compared with four state of the art MOEAs, namely the original MOEA/D, Adaptive-MOEA/D, [Formula: see text]-MOEA/D, and NSGA-II on 10 widely used test problems, two newly constructed complex problems, and two many-objective problems. Experimental results indicate that MOEA/D-AWA outperforms the benchmark algorithms in terms of the IGD metric, particularly when the PF of the MOP is complex.
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
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
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Nonlinear Multiobjective Optimization
Miettinen, K. (1998) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5563-6 · Cited by 4,710
Performance assessment of multiobjective optimizers: an analysis and review
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810758 · Cited by 4,330
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Schaffer, J. D. (1985) · international conference on Genetic algorithms · Cited by 3,326
Nonlinear Multiobjective Optimization
Mardle, S., & Miettinen, K. M. (2000) · The Journal of the Operational Research Society · doi:10.2307/254267 · Cited by 3,049
Das, I., & Dennis, J. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496307510 · Cited by 2,654
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
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
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
Fonseca, C. M., & Fleming, P. J. (1993) · Cited by 2,056
Evolutionary multi-objective optimization: a historical view of the field
Coello Coello, C. A. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2006.1597059 · Cited by 1,446
PESA-II: region-based selection in evolutionary multiobjective optimization
Corne, D., Jerram, N. R., Knowles, J. D., & Oates, M. J. (2001) · Cited by 1,011
Genetic Algorithms, Tournament Selection, and the Effects of Noise.
Miller, B. L., & Goldberg, D. E. (1995) · Cited by 962
(2004) · Lecture Notes in Computer Science · doi:10.1007/b98643 · Cited by 957
Evolutionary many-objective optimization: A short review
Ishibuchi, H., Tsukamoto, N., & Nojima, Y. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4631121 · Cited by 914
The Pareto Envelope-Based Selection Algorithm for Multiobjective Optimization
Corne, D. W., Knowles, J. D., & Oates, M. J. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_82 · Cited by 884
The normalized normal constraint method for generating the Pareto frontier
Messac, A., Ismail-Yahaya, A., & Mattson, C. A. (2003) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-002-0276-1 · Cited by 764
Expensive Multiobjective Optimization by MOEA/D With Gaussian Process Model
Zhang, Q., Liu, W., Tsang, E., & Virginas, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033671 · Cited by 746
The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances
Zhang, Q., Liu, W., & Li, H. (2009) · 2009 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2009.4982949 · Cited by 624
(2000) · Institute of Physics eBooks · doi:10.1887/0750306653 · Cited by 616
Self-Adaptive Genetic Algorithms with Simulated Binary Crossover
Deb, K., & Beyer, H.-G. (2001) · Evolutionary Computation · doi:10.1162/106365601750190406 · Cited by 437
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
Proceedings of the Genetic and Evolutionary Computation Conference
(2019) · doi:10.1145/3321707 · Cited by 319
Objective Reduction in Many-Objective Optimization: Linear and Nonlinear Algorithms
Saxena, D. K., Duro, J. A., Tiwari, A., Deb, K., & Zhang, Q. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2185847 · Cited by 302
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
Singh, H. K., Isaacs, A., & Ray, T. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2093579 · Cited by 250
A multi-objective particle swarm optimizer based on decomposition
Zapotecas Martínez, S., & Coello Coello, C. A. (2011) · Proceedings of the 13th annual conference on Genetic and evolutionary computation · doi:10.1145/2001576.2001587 · Cited by 246
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
An Adaptive Evolutionary Multi-Objective Approach Based on Simulated Annealing
Li, H., & Landa-Silva, D. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00038 · Cited by 178
Evolutionary many-objective optimization
Ishibuchi, H., Tsukamoto, N., & Nojima, Y. (2008) · IEEE International Workshop on Genetic and Evolutionary Fuzzy Systems (GEFS) · doi:10.1109/gefs.2008.4484566 · Cited by 154
Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm
Wang, L., Zhang, Q., Zhou, A., Gong, M., & Jiao, L. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2457616 · Cited by 152
Self-citationSimultaneous use of different scalarizing functions in MOEA/D
Ishibuchi, H., Sakane, Y., Tsukamoto, N., & Nojima, Y. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830577 · Cited by 135
Das, I., & Dennis, J. E. (1996) · Cited by 130
Ishibuchi, H., Sakane, Y., Tsukamoto, N., & Nojima, Y. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01020-0_35 · Cited by 129
A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems
Kukkonen, S., & Deb, K. (2006) · Lecture notes in computer science · doi:10.1007/11844297_56 · Cited by 126
Saxena, D. K., & Deb, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-70928-2_58 · Cited by 121
MOEA/D with NBI-style Tchebycheff approach for portfolio management
Zhang, Q., Li, H., Maringer, D. G., & Tsang, E. P. K. (2010) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2010.5586185 · Cited by 110
MOEA/D for flowshop scheduling problems
Chang, P., Chen, S.-H., Zhang, Q., & Lin, J. (2008) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2008.4630982 · Cited by 84
MOEA/D with opposition-based learning for multiobjective optimization problem
Ma, X., Liu, F., Qi, Y., Gong, M., Yin, M., Li, L., Jiao, L., & Wu, J. (2014) · Neurocomputing · doi:10.1016/j.neucom.2014.04.068 · Cited by 78
Self-citationLINEAR ANTENNA ARRAY SYNTHESIS WITH CONSTRAINED MULTI-OBJECTIVE DIFFERENTIAL EVOLUTION
Pal, S., Qu, B., Das, S., & Suganthan, P. N. (2010) · Progress In Electromagnetics Research B · doi:10.2528/pierb10022609 · Cited by 76
Enhancing MOEA/D with guided mutation and priority update for multi-objective optimization
Chen, C., Chen, Y., & Zhang, Q. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4982950 · Cited by 76
A clustering-ranking method for many-objective optimization
Cai, L., Qu, S., Yuan, Y., & Yao, X. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.06.020 · Cited by 56
Shim, V. A., Tan, K. C., & Tan, K. K. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256438 · Cited by 32
Pal, S., Das, S., Basak, A., & Suganthan, P. N. (2010) · Progress In Electromagnetics Research B · doi:10.2528/pierb10033107 · Cited by 27
Multiple objective optimisation applied to route planning
Waldock, A., & Corne, D. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001821 · Cited by 21
Cited by
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
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
A Comprehensive Review on Multi-objective Optimization Techniques: Past, Present and Future
Sharma, S., & Kumar, V. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09778-9 · Cited by 455
Metadata
- Authors
- Qi, Y., Ma, X., Liu, F., Jiao, L., Sun, J., & Wu, J.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 2014-06
- Volume
- 22
- Issue
- 2
- Pages
- 231-264
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2023685757
- Cited by
- 690
- References
- 48
- FWCI
- 23.37
- Type
- journal article
- Language
- en
- Open access
- green
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.