The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Adaptive Replacement Strategies for MOEA/D
Abstract
Multiobjective evolutionary algorithms based on decomposition (MOEA/D) decompose a multiobjective optimization problem into a set of simple optimization subproblems and solve them in a collaborative manner. A replacement scheme, which assigns a new solution to a subproblem, plays a key role in balancing diversity and convergence in MOEA/D. This paper proposes a global replacement scheme which assigns a new solution to its most suitable subproblems. We demonstrate that the replacement neighborhood size is critical for population diversity and convergence, and develop an approach for adjusting this size dynamically. A steady-state algorithm and a generational one with this approach have been designed and experimentally studied. The experimental results on a number of test problems have shown that the proposed algorithms have some advantages.
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
Self-citationDeb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
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 · cited 1×
“in which the selection operation is mainly based on the Pareto dominance relations among solutions in a population [8]–[11];”
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
Differential Evolution: A Survey of the State-of-the-Art
Das, S., & Suganthan, P. N. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2059031 · Cited by 5,307
Survey of multi-objective optimization methods for engineering
Marler, R. T., & Arora, J. S. (2004) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-003-0368-6 · Cited by 4,710
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
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-citationApproximating 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
Indicator-Based Selection in Multiobjective Search
Zitzler, E., & Künzli, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30217-9_84 · Cited by 2,259
Jain, H., & Deb, K. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281534 · Cited by 2,172
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Bader, J., & Zitzler, E. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00009 · Cited by 2,081
Adaptive Particle Swarm Optimization
Zhan, Z.-H., Zhang, J., Li, Y., & Chung, H. S.-H. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2015956 · Cited by 2,075
SMS-EMOA: Multiobjective selection based on dominated hypervolume
Beume, N., Naujoks, B., & Emmerich, M. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.008 · Cited by 2,048
Scalable Test Problems for Evolutionary Multiobjective Optimization
Deb, K., Thiele, L., Laumanns, M., & Zitzler, E. (2005) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-137-7_6 · Cited by 2,010
A combined genetic adaptive search (GeneAS) for engineering design
Deb, K., & Goyal, M. K. (1996) · Cited by 1,229
The balance between proximity and diversity in multiobjective evolutionary algorithms
Bosman, P. A. N., & Thierens, D. (2003) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.810761 · Cited by 1,154
Solving Multiobjective Optimization Problems Using an Artificial Immune System
Coello, C. A. C., & Cort�s, N. C. (2005) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-005-6164-x · Cited by 1,062
A multi-objective genetic local search algorithm and its application to flowshop scheduling
Ishibuchi, H., & Murata, T. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.704576 · Cited by 1,019
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
Liu, H.-L., Gu, F., & Zhang, Q. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281533 · Cited by 813
Self-citationMOEA/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
Self-citationSchutze, O., Esquivel, X., Lara, A., & Coello, C. A. C. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2161872 · Cited by 511
Zhan, Z.-H., Li, J., Cao, J., Zhang, J., Chung, H. S.-H., & Shi, Y.-H. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2209115 · Cited by 346
Wang, Y., Cai, Z., Guo, G., & Zhou, Y. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.886164 · Cited by 250
A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization
Liu, D., Tan, K. C., Goh, C. K., & Ho, W. K. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.883270 · Cited by 241
Decomposition-Based Multiobjective Evolutionary Algorithm With an Ensemble of Neighborhood Sizes
Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2166159 · Cited by 232
Self-citationA Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling
Li, B.-B., & Wang, L. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.887946 · Cited by 208
Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms
Murata, T., Ishibuchi, H., & Gen, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44719-9_6 · Cited by 193
Giagkiozis, I., Purshouse, R. C., & Fleming, P. J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-37140-0_33 · Cited by 71
Xia, H., Zhuang, J., & Yu, D. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2256418 · Cited by 46
Cited by
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
Improving Metaheuristic Algorithms With Information Feedback Models
Wang, G.-G., & Tan, Y. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2780274 · Cited by 285
Metadata
- Authors
- Wang, Z., Zhang, Q., Zhou, A., Gong, M., & Jiao, L.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2016-02
- Volume
- 46
- Issue
- 2
- Pages
- 474-486
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2017299308
- Cited by
- 257
- References
- 36
- FWCI
- 20.96
- 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.