Self-adaptive hyperheuristic and greedy search

In previous work, we have introduced an effective and resource-efficient hyperheuristic that uses Genetic Programming as its search heuristic on the space of heuristics. Here, we show that the hyperheuristic performs better than purely greedy and even only mostly greedy flavours of hill climbing. We also introduce a generic principle that allows the hyperheuristic to automatically find good parameter values for its effective and efficient search.