HYPERION: a recursive hyper-heuristic framework

  • Authors:
  • Jerry Swan;Ender Özcan;Graham Kendall

  • Affiliations:
  • Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, Nottingham, UK;Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, Nottingham, UK;Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, Nottingham, UK

  • Venue:
  • LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hyper-heuristics are methodologies used to search the space of heuristics for solving computationally difficult problems. We describe an object-oriented domain analysis for hyper-heuristics that orthogonally decomposes the domain into generative policy components. The framework facilitates the recursive instantiation of hyper-heuristics over hyper-heuristics, allowing further exploration of the possibilities implied by the hyper-heuristic concept. We describe Hyperion, a JavaTM class library implementation of this domain analysis.