The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
A Survey on the Hypervolume Indicator in Evolutionary Multiobjective Optimization
Abstract
Hypervolume is widely used as a performance indicator in the field of evolutionary multiobjective optimization (EMO). It is used not only for performance evaluation of EMO algorithms (EMOAs) but also in indicator-based EMOAs to guide the search. Since its initial proposal in the late 1990s, a wide variety of studies have been done on various topics, including hypervolume calculation, optimal μ-distribution, subset selection, hypervolume-based EMOAs, and extensions of the hypervolume indicator. However, currently there is no work to systematically survey the hypervolume indicator for these topics whereas it has been frequently used in the EMO field. This article aims to fill this gap and provide a comprehensive survey on the hypervolume indicator. We expect that this survey will help EMO researchers to understand the hypervolume indicator more deeply and thoroughly, and promote further utilization of the hypervolume indicator in the EMO field.
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
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
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Completely Derandomized Self-Adaptation in Evolution Strategies
Hansen, N., & Ostermeier, A. (2001) · Evolutionary Computation · doi:10.1162/106365601750190398 · Cited by 4,397
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
Das, I., & Dennis, J. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496307510 · Cited by 2,654
Multiobjective optimization using evolutionary algorithms — A comparative case study
Zitzler, E., & Thiele, L. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0056872 · Cited by 2,262
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
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
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
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
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Lamont, G. B., & Veldhuizen, D. A. V. (1999) · Cited by 1,212
A faster algorithm for calculating hypervolume
While, L., Hingston, P., Barone, L., & Huband, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851275 · Cited by 1,100
Covariance Matrix Adaptation for Multi-objective Optimization
Igel, C., Hansen, N., & Roth, S. (2007) · Evolutionary Computation · doi:10.1162/evco.2007.15.1.1 · Cited by 788
Single- and multiobjective evolutionary optimization assisted by Gaussian random field metamodels
Emmerich, M. T. M., Giannakoglou, K. C., & Naujoks, B. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.859463 · Cited by 759
Modified Distance Calculation in Generational Distance and Inverted Generational Distance
Ishibuchi, H., Masuda, H., Tanigaki, Y., & Nojima, Y. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-15892-1_8 · Cited by 739
Self-citationAn EMO Algorithm Using the Hypervolume Measure as Selection Criterion
Emmerich, M., Beume, N., & Naujoks, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31880-4_5 · Cited by 604
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
Self-citationEvaluating the quality of approximations to the non-dominated set
Hansen, M. P., & Jaszkiewicz, A. (1998) · Cited by 451
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
Accelerated greedy algorithms for maximizing submodular set functions
Minoux, M. (2005) · Springer eBooks · doi:10.1007/bfb0006528 · Cited by 411
Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point
Auger, A., Bader, J., Brockhoff, D., & Zitzler, E. (2009) · Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms · doi:10.1145/1527125.1527138 · Cited by 375
A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm
Jiang, S., Zhang, J., Ong, Y.-S., Zhang, A. N., & Tan, P. S. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2367526 · Cited by 259
A Review of Evolutionary Multimodal Multiobjective Optimization
Tanabe, R., & Ishibuchi, H. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2909744 · Cited by 245
Self-citationHow to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison
Ishibuchi, H., Imada, R., Setoguchi, Y., & Nojima, Y. (2018) · Evolutionary Computation · doi:10.1162/evco_a_00226 · Cited by 237
Self-citationPonweiser, W., Wagner, T., Biermann, D., & Vincze, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87700-4_78 · Cited by 224
Subset selection by Pareto optimization
Qian, C., Yu, Y., & Zhou, Z. (2015) · neural information processing systems · Cited by 205
Hypervolume-based expected improvement: Monotonicity properties and exact computation
Emmerich, M. T. M., Deutz, A. H., & Klinkenberg, J. W. (2011) · 2011 IEEE Congress of Evolutionary Computation (CEC) · doi:10.1109/cec.2011.5949880 · Cited by 200
On Tchebycheff Decomposition Approaches for Multiobjective Evolutionary Optimization
Ma, X., Zhang, Q., Tian, G., Yang, J., & Zhu, Z. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2704118 · Cited by 199
On Set-Based Multiobjective Optimization
Zitzler, E., Thiele, L., & Bader, J. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2016569 · Cited by 180
Multi-Objective Bayesian Global Optimization using expected hypervolume improvement gradient
Yang, K., Emmerich, M., Deutz, A. H., & Bäck, T. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.10.007 · Cited by 174
A Scalable Indicator-Based Evolutionary Algorithm for Large-Scale Multiobjective Optimization
Hong, W., Tang, K., Zhou, A., Ishibuchi, H., & Yao, X. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2881153 · Cited by 145
Self-citationA New Hypervolume-Based Evolutionary Algorithm for Many-Objective Optimization
Shang, K., & Ishibuchi, H. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2020.2964705 · Cited by 143
Self-citationComparison of Hypervolume, IGD and IGD+ from the Viewpoint of Optimal Distributions of Solutions
Ishibuchi, H., Imada, R., Masuyama, N., & Nojima, Y. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-12598-1_27 · Cited by 135
Self-citationLi, K., Deb, K., & Yao, X. (2017) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2737781 · Cited by 121
A fast hypervolume driven selection mechanism for many-objective optimisation problems
Rostami, S., & Neri, F. (2016) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.12.002 · Cited by 110
Efficient computation of expected hypervolume improvement using box decomposition algorithms
Yang, K., Emmerich, M., Deutz, A. H., & Bäck, T. (2019) · Journal of Global Optimization · doi:10.1007/s10898-019-00798-7 · Cited by 101
Reference point specification in hypervolume calculation for fair comparison and efficient search
Ishibuchi, H., Imada, R., Setoguchi, Y., & Nojima, Y. (2017) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3071178.3071264 · Cited by 100
Self-citationMaximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms
Friedrich, T., & Neumann, F. (2015) · Evolutionary Computation · doi:10.1162/evco_a_00159 · Cited by 87
Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice
Bringmann, K., & Friedrich, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01020-0_6 · Cited by 81
Rostami, S., & Neri, F. (2016) · Integrated Computer-Aided Engineering · doi:10.3233/ica-160529 · Cited by 75
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
Bringmann, K., & Friedrich, T. (2010) · Theoretical Computer Science · doi:10.1016/j.tcs.2010.09.026 · Cited by 71
Faster Exact Algorithms for Computing Expected Hypervolume Improvement
Hupkens, I., Deutz, A. H., Yang, K., & Emmerich, M. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-15892-1_5 · Cited by 65
Regular Pareto Front Shape is not Realistic
Ishibuchi, H., He, L., & Shang, K. (2019) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2019.8790342 · Cited by 51
Self-citationIshibuchi, H., Tsukamoto, N., Sakane, Y., & Nojima, Y. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4982991 · Cited by 49
Self-citationHypervolume Indicator Gradient Ascent Multi-objective Optimization
Wang, H., Deutz, A. H., Bäck, T., & Emmerich, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-54157-0_44 · Cited by 33
S.Russo, L. M., & Francisco, A. P. (2016) · Journal of Heuristics · doi:10.1007/s10732-016-9309-6 · Cited by 26
Emmerich, M., Deutz, A. H., & Yevseyeva, I. (2014) · Procedia Technology · doi:10.1016/j.protcy.2014.10.001 · Cited by 25
Cited by
A Survey on Evolutionary Constrained Multiobjective Optimization
Liang, J., Ban, X., Yu, K., Qu, B., Qiao, K., Yue, C., Chen, K., & Tan, K. C. (2023) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2022.3155533 · Cited by 438
Metadata
- Authors
- Shang, K., Ishibuchi, H., He, L., & Pang, L. M.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2021-02
- Volume
- 25
- Issue
- 1
- Pages
- 1-20
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W3046910774
- Cited by
- 380
- References
- 53
- FWCI
- 17.15
- 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.