The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
An Investigation on Preference Order Ranking Scheme for Multiobjective Evolutionary Optimization
Abstract
It may be generalized that all Evolutionary Algorithms (EA) draw their strength from two sources: exploration and exploitation. Surprisingly, within the context of multiobjective (MO) optimization, the impact of fitness assignment on the exploration-exploitation balance has drawn little attention. The vast majority of multiobjective evolutionary algorithms (MOEAs) presented to date resort to Pareto dominance classification as a fitness assignment methodology. However, the proportion of Pareto optimal elements in a set P grows with the dimensionality of P. Therefore, when the number of objectives of a multiobjective problem (MOP) is large, Pareto dominance-based ranking procedures become ineffective in sorting out the quality of solutions. This paper investigates the potential of using preference order-based approach as an optimality criterion in the ranking stage of MOEAs. A ranking procedure that exploits the definition of preference ordering (PO) is proposed, along with two strategies that make different use of the conditions of efficiency provided, and it is compared with a more traditional Pareto dominance-based ranking scheme within the framework of NSGA-II. A series of extensive experiments is performed on seven widely applied test functions, namely, DTLZ1, DTLZ2, DTLZ3, DTLZ4, DTLZ5, DTLZ6, and DTLZ7, for up to eight objectives. The results are analyzed through a suite of five performance metrics and indicate that the ranking procedure based on PO enables NSGA-II to achieve better scalability properties compared with the standard ranking scheme and suggest that the proposed methodology could be successfully extended to other MOEAs
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
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
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
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
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45356-3_83 · Cited by 5,289
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Evolutionary Algorithms for Solving Multi-Objective Problems
Coello Coello, C. A., Van Veldhuizen, D. A., & Lamont, G. B. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4757-5184-0 · Cited by 2,663
Das, I., & Dennis, J. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496307510 · Cited by 2,654
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
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
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
A Knee Point-Driven Evolutionary Algorithm for Many-Objective Optimization
Zhang, X., Tian, Y., & Jin, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2378512 · Cited by 867
A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization
Yuan, Y., Xu, H., Wang, B., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2420112 · Cited by 752
Borg: An Auto-Adaptive Many-Objective Evolutionary Computing Framework
Hadka, D., & Reed, P. (2013) · Evolutionary Computation · doi:10.1162/evco_a_00075 · Cited by 717
Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization
Li, M., Yang, S., & Liu, X. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2262178 · Cited by 714
Zhang, X., Tian, Y., Cheng, R., & Jin, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2600642 · Cited by 660
Maier, H. R., Kapelan, Z., Kasprzyk, J., Kollat, J., Matott, L. S., Cunha, M. C., Dandy, G. C., Gibbs, M. S., Keedwell, E., Marchi, A., et al. (2014) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2014.09.013 · Cited by 657
State of the Art for Genetic Algorithms and Beyond in Water Resources Planning and Management
Nicklow, J., Reed, P., Savic, D., Dessalegne, T., Harrell, L., Chan-Hilton, A., Karamouz, M., Minsker, B., Ostfeld, A., Singh, A., et al. (2010) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)wr.1943-5452.0000053 · Cited by 624
Evolutionary multiobjective optimization in water resources: The past, present, and future
Reed, P. M., Hadka, D., Herman, J. D., Kasprzyk, J. R., & Kollat, J. B. (2013) · Advances in Water Resources · doi:10.1016/j.advwatres.2012.01.005 · Cited by 541
IGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems
Sun, Y., Yen, G. G., & Yi, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2791283 · Cited by 519
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
Jiang, S., & Yang, S. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2592479 · Cited by 376
Panichella, A., Kifetew, F. M., & Tonella, P. (2018) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2663435 · Cited by 352
Fuzzy-Based Pareto Optimality for Many-Objective Evolutionary Algorithms
He, Z., Yen, G. G., & Zhang, J. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2258025 · Cited by 350
Lin, Q., Liu, S., Zhu, Q., Tang, C., Song, R., Chen, J., Coello, C. A. C., Wong, K.-C., & Zhang, J. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2631279 · Cited by 309
A survey on multi-objective evolutionary algorithms for many-objective problems
von Lücken, C., Barán, B., & Brizuela, C. (2014) · Computational Optimization and Applications · doi:10.1007/s10589-014-9644-1 · Cited by 297
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
Many-Objective Software Remodularization Using NSGA-III
Mkaouer, W., Kessentini, M., Shaout, A., Koligheu, P., Bechikh, S., Deb, K., & Ouni, A. (2015) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/2729974 · Cited by 267
Metadata
- Authors
- di Pierro, F., Khu, S.-T., & Savi, D. A.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2007-02
- Volume
- 11
- Issue
- 1
- Pages
- 17-45
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2116555342
- Cited by
- 280
- References
- 21
- FWCI
- 12.56
- 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.