|
Class Summary |
| Crossover |
A slightly more complex improvement heuristic. |
| Hungry |
Tries to improve every solution in the pool by including as many good
mappings as possible. |
| Identity |
This trivial improvement heuristic simply returns the provided solution pool. |
| LocalBranching |
This heuristic works by creating a constrained sub-problem and then solving
it. |
| Mutation |
A slightly more complex improvement heuristic. |
| RandomRemove |
A simple improvement heuristic that removes a specified fraction of AMs at
random from every solution in the pool. |
| RemoveWorst |
Simple "improvement" heuristic that works by removing the worst solution
(IdSet) from the feasible pool. |