A New Hyperheuristic Algorithm for Cross-Domain Search Problems
This paper describes a new hyperheuristic algorithm that performs well over a variety of different problem classes. A novel method for switching between working on a single solution and a pool of solutions is proposed. This method is combined with an adaptive strategy that guides the selection of the underlying low-level heuristics throughout the search. The algorithm was implemented based on the HyFlex framework and was submitted as a candidate for the Cross-Domain Heuristic Search Challenge 2011.
KeywordsProblem Instance Flow Shop Tabu List Search Phase Permutation Flow Shop
Unable to display preview. Download preview PDF.
- 2.Burke, E., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: A survey of hyper-heuristics. Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747, School of Computer Science and Information Technology, University of Nottingham (2009)Google Scholar
- 3.Burke, E., Curtois, T., Hyde, M., Kendall, G., Ochoa, G., Petrovic, S., Antonio, J.: HyFlex: A Flexible Framework for the Design and Analysis of Hyper-heuristics. In: Multidisciplinary International Scheduling Conference (MISTA 2009), Dublin, Ireland, p. 790 (2009)Google Scholar