Paper · 2009 · Open access
Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, 87–102 · Published 9 January 2009 · DOI 10.1145/1527125.1527138
In brief
“Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point” is a 2009 paper by Anne Auger and 3 co-authors, published in Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms. OpenAlex counts 460 citations as of 19 November 2026, which puts it in the top 1% of works published in 2009 by citations. It is open access: the full text is free to read at HAL.
- Citations
- 460
- Most cited in
- 2018 (36)
- Field-weighted impact
- 13.69
- References
- 31
- Authors
- 4
Abstract
The hypervolume indicator is a set measure used in evolutionary multiobjective optimization to evaluate the performance of search algorithms and to guide the search. Multiobjective evolutionary algorithms using the hypervolume indicator transform multiobjective problems into single objective ones by searching for a finite set of solutions maximizing the corresponding hypervolume indicator. In this paper, we theoretically investigate how those optimal μ--distributions-finite sets of μ solutions maximizing the hypervolume indicator-are spread over the Pareto front of biobjective problems. This problem is of high importance for practical applications as these sets characterize the preferences that the hypervolume indicator encodes, i.e., which types of Pareto set approximations are favored.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Auger, A., Bader, J., Brockhoff, D., & Zitzler, E. (2009). Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point. Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, 87–102. https://doi.org/10.1145/1527125.1527138
MLA 9
Auger, Anne, et al. “Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point.” Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, 2009, pp. 87–102. https://doi.org/10.1145/1527125.1527138.
Chicago
Auger, Anne, Johannes Bader, Dimo Brockhoff, and Eckart Zitzler. 2009. “Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point.” Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms: 87–102. https://doi.org/10.1145/1527125.1527138.
Harvard
Auger, A. et al. (2009) ‘Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point’, Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pp. 87–102. doi:10.1145/1527125.1527138.
IEEE
A. Auger, J. Bader, D. Brockhoff, and E. Zitzler, “Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point,” Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pp. 87–102, 2009, doi: 10.1145/1527125.1527138.
BibTeX
@article{auger2009theory,
title = {{Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point}},
author = {Auger, Anne and Bader, Johannes and Brockhoff, Dimo and Zitzler, Eckart},
journal = {Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms},
year = {2009},
pages = {87--102},
doi = {10.1145/1527125.1527138},
url = {https://doi.org/10.1145/1527125.1527138}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 22 | |
| 2018 | 36 | |
| 2019 | 34 | |
| 2020 | 32 | |
| 2021 | 26 | |
| 2022 | 29 | |
| 2023 | 32 | |
| 2024 | 23 | |
| 2025 | 22 | |
| 2026 | 33 |
Its field-weighted citation impact is 13.69: it has been cited 13.69 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- hypervolume indicator
- multi-objective evolutionary algorithms
- Pareto front approximation
- indicator-based selection
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Auger, A., Bader, J., Brockhoff, D., & Zitzler, E. (2009). Theory of the hypervolume indicator: optimal μ-distributions and the choice of the reference point. Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, 87–102. https://doi.org/10.1145/1527125.1527138
How many times has this paper been cited?
460 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at HAL: sign in and open the full text from this page.
Who wrote this paper?
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart Zitzler.
What is the DOI of this paper?
10.1145/1527125.1527138, permanently at https://doi.org/10.1145/1527125.1527138. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.