public class AdaptiveGridArchive<S extends Solution<?>> extends AbstractBoundedArchive<S>
archive, maxSize| Constructor and Description |
|---|
AdaptiveGridArchive(int maxSize,
int bisections,
int objectives)
Constructor.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(S solution)
Adds a
Solution to the setArchive. |
void |
computeDensityEstimator() |
Comparator<S> |
getComparator() |
AdaptiveGrid<S> |
getGrid() |
void |
prune() |
void |
sortByDensityEstimator() |
get, getMaxSize, getSolutionList, sizepublic AdaptiveGridArchive(int maxSize,
int bisections,
int objectives)
maxSize - The maximum size of the setArchivebisections - The maximum number of bi-divisions for the adaptive
grid.objectives - The number of objectives.public boolean add(S solution)
Solution to the setArchive. If the Solution
is dominated by any member of the setArchive then it is discarded. If the
Solution dominates some members of the setArchive, these are
removed. If the setArchive is full and the Solution has to be
inserted, one Solution of the most populated hypercube of the
adaptive grid is removed.public AdaptiveGrid<S> getGrid()
public void prune()
prune in class AbstractBoundedArchive<S extends Solution<?>>public Comparator<S> getComparator()
public void computeDensityEstimator()
public void sortByDensityEstimator()
Copyright © 2017. All rights reserved.