The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Rank-density-based multiobjective genetic algorithm and benchmark test function study
Abstract
Concerns the use of evolutionary algorithms (EA) in solving multiobjective optimization problems (MOP). We propose the use of a rank-density-based genetic algorithm (RDGA) that synergistically integrates selected features from existing algorithms in a unique way. A new ranking method, automatic accumulated ranking strategy, and a "forbidden region" concept are introduced, completed by a revised adaptive cell density evaluation scheme and a rank-density-based fitness assignment technique. In addition, four types of MOP features, such as discontinuous and concave Pareto front, local optimality, high-dimensional decision space and high-dimensional objective space are exploited and the corresponding MOP test functions are designed. By examining the selected performance indicators, RDGA is found to be statistically competitive with four state-of-the-art algorithms in terms of keeping the diversity of the individuals along the tradeoff surface, tending to extend the Pareto front to new areas and finding a well-approximated Pareto optimal front.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
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 by
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
Multi-objective optimization using genetic algorithms: A tutorial
Konak, A., Coit, D. W., & Smith, A. E. (2006) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2005.11.018 · Cited by 3,440
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
Constraint Handling in Multiobjective Evolutionary Optimization
Woldesenbet, Y. G., Yen, G. G., & Tessema, B. G. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.2009032 · Cited by 420
Self-citationA Multiobjective Optimization-Based Evolutionary Algorithm for Constrained Optimization
Cai, Z., & Wang, Y. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.872344 · Cited by 400
A Steady-State and Generational Evolutionary Algorithm for Dynamic Multiobjective Optimization
Jiang, S., & Yang, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2574621 · Cited by 364
Adaptive Multiobjective Particle Swarm Optimization Based on Parallel Cell Coordinate System
Hu, W., & Yen, G. G. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2296151 · Cited by 273
Self-citation
Metadata
- Authors
- Lu, H., & Yen, G. G.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2003-08
- Volume
- 7
- Issue
- 4
- Pages
- 325-343
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2124180027
- Cited by
- 177
- References
- 3
- FWCI
- 6.92
- 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.