Walking Fish Group:
hypervolume project
We have developed a series of algorithms based on HSO (Hypervolume by Slicing Objectives), both for calculating the hypervolume of a non-dominated front, for use as a metric, and for calculating the exclusive hypervolume of a point vs a front, for use in selection, archiving, or diversity calculations.
The papers published in this project
To generate a random non-dominated front, we initialise S = empty, generate an infinite list of points, and test each point p in turn, adding p to S only if {p} U S is a non-dominated front. Each objective value is in [0.1,10].
For each DTLZ front, we generated a representative sample containing 10,000 points. Then to generate a front we select points randomly from the sample.
THE DATA USED IN WFG2005d and WFG2006a
| random | linear | spherical | discontinuous | degenerate | ||
| 3D | zip | zip | zip | zip | zip | rev |
| 4D | zip | zip | zip | zip | zip | rev |
| 5D | zip | zip | zip | zip | zip | rev |
| 6D | zip | zip | zip | zip | zip | rev |
| 7D | zip | zip | zip | zip | zip | rev |
| 8D | zip | zip | zip | zip | zip | rev |
| 9D | zip | zip | zip | zip | zip | rev |
| 10D | ---- | ---- | zip | ---- | zip | ---- |
| 11D | ---- | ---- | zip | ---- | zip | ---- |
| 12D | ---- | ---- | zip | ---- | zip | ---- |
| 13D | ---- | ---- | zip | ---- | zip | ---- |
THE DATA USED IN WFG2008a
(coming soon)
IMPLEMENTATIONS
Metric HSO implementation (coming soon)
Incremental HSO implementation (coming soon)
©2005-7 Walking Fish Group