A Hyper-Heuristic Based on Random Gradient, Greedy and Dominance

  • Ender Özcan
  • Ahmed Kheiri
Conference paper


Hyper-heuristics have emerged as effective general methodologies that are motivated by the goal of building or selecting heuristics automatically to solve a range of hard computational search problems with less development cost. HyFlex is a publicly available hyper-heuristic tool for rapid development and research which currently provides an interface to four problem domains along with relevant low level heuristics. A multistage hyper-heuristic based on random gradient and greedy with dominance heuristic selection methods is introduced in this study. This hyper-heuristic is implemented as an extension to HyFlex. The empirical results show that our approach performs better than some previously proposed hyper-heuristics over the given problem domains.


  1. 1.
    Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. School of Computer Science and Information Technology, University of Nottingham, Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747 (2010)Google Scholar
  2. 2.
    Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Selected Papers from the Third International Conference on Practice and Theory of Automated Timetabling, pp. 176–190. Springer-Verlag, London (2001)Google Scholar
  3. 3.
    Cowling, P., Chakhlevitch, K. (2003) Hyperheuristics for managing a large collection of low level heuristics to schedule personnel. In: Proceedings of the 2003 Congress on Evolutionary Computation, pp. 1214–1221Google Scholar
  4. 4.
    Swan, J., Özcan, E., Kendall, G.: Hyperion—a recursive hyper-heuristic framework. In: Coello, C.A.C. (ed.) Learning and Intelligent Optimization, 5th International Conference, LION 5 (2011)Google Scholar
  5. 5.
    Burke, E., Curtois, T., Hyde, M., Kendall, G., Ochoa, G., Petrovic, S., Vazquez-Rodriguez, J.: Hyflex: a flexible framework for the design and analysis of hyper-heuristics. In: Proceedings of the Multidisciplinary International Scheduling Conference (MISTA09), pp. 790–797 (2009)Google Scholar
  6. 6.
    Özcan, E., Bilgin, B., Korkmaz, E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3–23 (2008)Google Scholar
  7. 7.
    Burke, E.K., Curtois, T., Hyde, M.R., Kendall, G., Ochoa, G., Petrovic, S., Rodríguez, J.A.V., Gendreau, M.: Iterated local search vs. hyper-heuristics: towards general-purpose search algorithms. In: IEEE Congress on Evolutionary Computation, pp. 1–8 (2010)Google Scholar
  8. 8.
    Deb, K.: Multi-objective genetic algorithms: problem difficulties and construction of test problems. Evol. Comput. 7, 205–230 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited  2011

Authors and Affiliations

  1. 1.School of Computer ScienceUniversity of NottinghamNottinghamUK

Personalised recommendations