A Hyperheuristic Approach to Scheduling a Sales Summit

  • Peter Cowling
  • Graham Kendall
  • Eric Soubeiga
Conference paper

DOI: 10.1007/3-540-44629-X_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2079)
Cite this paper as:
Cowling P., Kendall G., Soubeiga E. (2001) A Hyperheuristic Approach to Scheduling a Sales Summit. In: Burke E., Erben W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg

Abstract

The concept of a hyperheuristic is introduced as an approach that operates at a higher lever of abstraction than current metaheuristic approaches. The hyperheuristic manages the choice of which lowerlevel heuristic method should be applied at any given time, depending upon the characteristics of the region of the solution space currently under exploration. We analyse the behaviour of several different hyperheuristic approaches for a real-world personnel scheduling problem. Results obtained show the effectiveness of our approach for this problem and suggest wider applicability of hyperheuristic approaches to other problems of scheduling and combinatorial optimisation.

keywords

hyperheuristics metaheuristics heuristics personnel scheduling local search choice function 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Peter Cowling
    • 1
  • Graham Kendall
    • 1
  • Eric Soubeiga
    • 1
  1. 1.Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science and Information TechnologyThe University of NottinghamNottinghamUK

Personalised recommendations