Towards fast approximations for the hypervolume indicator for multi-objective optimization problems by Genetic Programming
Hypervolume (HV) has become one of the most popular indicators to assess the quality of Pareto front approximations. However, the best algorithm for computing these values has a computational complexity of O(Nk/3polylog(N)) for N candidate solutions and k objectives. In this study, we propose a regr...
Saved in:
| Published in: | Applied soft computing Vol. 125; p. 109103 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.08.2022
|
| Subjects: | |
| ISSN: | 1568-4946, 1872-9681 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!