A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms
2010
IEEE Congress on Evolutionary Computation
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across different problem domains. This article conducts an empirical study involving three different domains in combinatorial optimisation: bin packing, permutation flow shop and personnel scheduling. Using a common software interface (HyFlex), the same algorithms (high-level strategies or hyperheuristics) can be readily run
doi:10.1109/cec.2010.5586064
dblp:conf/cec/BurkeCHKOPRG10
fatcat:p5gne5fuordndhjokcyhzohah4