The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization
Abstract
Decomposition-based evolutionary algorithms have been quite successful in solving optimization problems involving two and three objectives. Recently, there have been some attempts to exploit the strengths of decomposition-based approaches to deal with many objective optimization problems. Performance of such approaches are largely dependent on three key factors: 1) means of reference point generation; 2) schemes to simultaneously deal with convergence and diversity; and 3) methods to associate solutions to reference directions. In this paper, we introduce a decomposition-based evolutionary algorithm wherein uniformly distributed reference points are generated via systematic sampling, balance between convergence and diversity is maintained using two independent distance measures, and a simple preemptive distance comparison scheme is used for association. In order to deal with constraints, an adaptive epsilon formulation is used. The performance of the algorithm is evaluated using standard benchmark problems, i.e., DTLZ1-DTLZ4 for 3, 5, 8, 10, and 15 objectives, WFG1-WFG9, the car side impact problem, the water resource management problem, and the constrained ten-objective general aviation aircraft design problem. Results of problems involving redundant objectives and disconnected Pareto fronts are also included in this paper to illustrate the capability of the algorithm. The study clearly highlights that the proposed algorithm is better or at par with recent reference direction-based approaches for many objective optimization.
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
Deb, K., & Jain, H. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281535 · Cited by 7,133
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
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
Jain, H., & Deb, K. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281534 · Cited by 2,172
A 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
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
jMetal: A Java framework for multi-objective optimization
Durillo, J. J., & Nebro, A. J. (2011) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2011.05.014 · Cited by 1,134
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
A Grid-Based Evolutionary Algorithm for Many-Objective Optimization
Yang, S., Li, M., Liu, X., & Zheng, J. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2227145 · Cited by 893
Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization
Wagner, T., Beume, N., & Naujoks, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70928-2_56 · Cited by 425
Preference-Inspired Coevolutionary Algorithms for Many-Objective Optimization
Wang, R., Purshouse, R. C., & Fleming, P. J. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2204264 · Cited by 406
Evolutionary many-objective optimisation: Many once or one many?
Hughes, E. J. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554688 · Cited by 360
A New Evolutionary Algorithm for Solving Many-Objective Optimization Problems
Zou, X., Chen, Y., Liu, M., & Kang, L. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2008.926329 · Cited by 326
MULTIOBJECTIVE DESIGN OPTIMIZATION BY AN EVOLUTIONARY ALGORITHM
RAY, T., TAI, K., & SEOW, K. C. (2001) · Engineering Optimization · doi:10.1080/03052150108940926 · Cited by 294
Self-citationBehavior 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
Substitute Distance Assignments in NSGA-II for Handling Many-objective Optimization Problems
Köppen, M., & Yoshida, K. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70928-2_55 · Cited by 263
Diversity Management in Evolutionary Many-Objective Optimization
Adra, S. F., & Fleming, P. J. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2058117 · Cited by 262
Singh, H. K., Isaacs, A., & Ray, T. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2093579 · Cited by 250
Self-citationDeb, K., Sinha, A., Korhonen, P. J., & Wallenius, J. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2010.2064323 · Cited by 233
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
MOEA/D + uniform design: A new version of MOEA/D for optimization problems with many objectives
Tan, Y.-Y., Jiao, Y.-C., Li, H., & Wang, X.-K. (2013) · Computers & Operations Research · doi:10.1016/j.cor.2012.01.001 · Cited by 168
Takahama, T., & Sakai, S. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.850256 · Cited by 160
MSOPS-II: A general-purpose Many-Objective optimiser
Hughes, E. J. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4424985 · Cited by 157
Saxena, D. K., & Deb, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-70928-2_58 · Cited by 121
Handling many-objective problems using an improved NSGA-II procedure
Deb, K., & Jain, H. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256519 · Cited by 110
An adaptive constraint handling approach embedded MOEA/D
Asafuddoula, M., Ray, T., Sarker, R. A., & Alam, K. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6252868 · Cited by 107
Self-citationGiagkiozis, 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
Diagnostic assessment of the borg MOEA for many-objective product family design problems
Hadka, D., Reed, P. M., & Simpson, T. W. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256466 · Cited by 57
Singh, H. K., Isaacs, A., Ray, T., & Smith, W. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89694-4_41 · Cited by 42
Self-citation
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
Two-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
Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes
Ishibuchi, H., Setoguchi, Y., Masuda, H., & Nojima, Y. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2587749 · Cited by 592
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
Metadata
- Authors
- Asafuddoula, M., Ray, T., & Sarker, R.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2015-06
- Volume
- 19
- Issue
- 3
- Pages
- 445-460
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2049862811
- Cited by
- 403
- References
- 32
- FWCI
- 33.49
- 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.