DMCA
A fast incremental hypervolume algorithm (2008)
Cached
Download Links
| Venue: | IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION |
| Citations: | 9 - 0 self |
BibTeX
@ARTICLE{Bradstreet08afast,
author = {Lucas Bradstreet and Lyndon While and Luigi Barone},
title = {A fast incremental hypervolume algorithm},
journal = {IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION},
year = {2008},
pages = {723}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
When hypervolume is used as part of the selection or archiving process in a multiobjective evolutionary algorithm, it is necessary to determine which solutions contribute the least hyper-volume to a front. Little focus has been placed on algorithms that quickly determine these solutions and there are no fast algorithms designed specifically for this purpose. We describe an algorithm, IHSO, that quickly determines a solution’s contribution. Further-more, we describe and analyse heuristics that reorder objectives to minimize the work required for IHSO to calculate a solution’s contribution. Lastly, we describe and analyze search techniques that reduce the amount of work required for solutions other than the least contributing one. Combined, these techniques allow multiob-jective evolutionary algorithms to calculate hypervolume inline in increasingly complex and large fronts in many objectives.
Keyphrases
fast incremental hypervolume algorithm solution con-tribution fast algorithm many objective multiobjective evolutionary algorithm little focus large front multiobjective optimization performance metric hypervolume inline evolutionary computation multiob-jective evolutionary algorithm index term diversity solution contribution search technique
