Journal article · 2023 · Open access
Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization
IEEE Transactions on Evolutionary Computation, 28(2), 432–444 · Published 6 April 2023 · DOI 10.1109/tevc.2023.3265347
In brief
“Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization” is a 2023 journal article by Liang Zhao and Qingfu Zhang, published in IEEE Transactions on Evolutionary Computation. OpenAlex counts 44 citations as of 19 November 2026, which puts it in the top 4% of works published in 2023 by citations. It is open access: the full text is free to read at CityUHK Scholars.
- Citations
- 44
- Most cited in
- 2025 (19)
- Field-weighted impact
- 6.39
- References
- 65
- Authors
- 2
Abstract
The hypervolume metric is widely used to guide the search in multiobjective optimization. However, in parallel expensive multiobjective optimization, the hypervolume-based multipoint expected improvement (EI) suffers from high computational overhead and scales poorly with the batch size. To address this issue, we integrate hypervolume-based EI with the MOEA/D framework and propose a novel EI, named the expected direction-based hypervolume improvement (DirHV-EI). The DirHV-EI only measures the hypervolume improvement within each axis-parallel box induced by the modified Tchebycheff scalarization. Thus, it has a simple analytical expression that can be easily computed. Theoretical analysis indicates that the maximization of our proposed improvement function can help to maximize both the weighted hypervolume and the Tchebycheff improvement metrics. Using DirHV-EI, we design a decomposition-based Bayesian optimization algorithm for solving expensive multiobjective optimization problems. At each iteration, the MOEA/D is used to maximize the DirHV-EI values with respect to a number of direction vectors in a collaborative manner, and a number of candidate solutions can be obtained. Then, a submodularity-based greedy selection strategy is used to select multiple query points from the candidates. Experimental results on both benchmark instances and real-world problems show that our proposed algorithm is an efficient and effective method for parallel expensive multiobjective optimization.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Zhao, L., & Zhang, Q. (2023). Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization. IEEE Transactions on Evolutionary Computation, 28(2), 432–444. https://doi.org/10.1109/tevc.2023.3265347
MLA 9
Zhao, Liang, and Qingfu Zhang. “Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization.” IEEE Transactions on Evolutionary Computation, vol. 28, no. 2, 2023, pp. 432–444. https://doi.org/10.1109/tevc.2023.3265347.
Chicago
Zhao, Liang and Qingfu Zhang. 2023. “Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization.” IEEE Transactions on Evolutionary Computation 28 (2): 432–444. https://doi.org/10.1109/tevc.2023.3265347.
Harvard
Zhao, L. and Zhang, Q. (2023) ‘Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization’, IEEE Transactions on Evolutionary Computation, 28(2), pp. 432–444. doi:10.1109/tevc.2023.3265347.
IEEE
L. Zhao and Q. Zhang, “Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization,” IEEE Transactions on Evolutionary Computation, vol. 28, no. 2, pp. 432–444, 2023, doi: 10.1109/tevc.2023.3265347.
BibTeX
@article{zhao2023hypervolume,
title = {{Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization}},
author = {Zhao, Liang and Zhang, Qingfu},
journal = {IEEE Transactions on Evolutionary Computation},
year = {2023},
volume = {28},
number = {2},
pages = {432--444},
doi = {10.1109/tevc.2023.3265347},
url = {https://doi.org/10.1109/tevc.2023.3265347}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2023 | 4 | |
| 2024 | 5 | |
| 2025 | 19 | |
| 2026 | 16 |
Its field-weighted citation impact is 6.39: it has been cited 6.39 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 metric
- parallel optimization
- MOEA/D
- expensive black-box optimization
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?
Zhao, L., & Zhang, Q. (2023). Hypervolume-Guided Decomposition for Parallel Expensive Multiobjective Optimization. IEEE Transactions on Evolutionary Computation, 28(2), 432–444. https://doi.org/10.1109/tevc.2023.3265347
How many times has this paper been cited?
44 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 CityUHK Scholars: sign in and open the full text from this page.
Who wrote this paper?
Liang Zhao, Qingfu Zhang.
What is the DOI of this paper?
10.1109/tevc.2023.3265347, permanently at https://doi.org/10.1109/tevc.2023.3265347. 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.