Chapter

Practice and Theory of Automated Timetabling III

Volume 2079 of the series Lecture Notes in Computer Science pp 176-190

Date:

A Hyperheuristic Approach to Scheduling a Sales Summit

  • Peter CowlingAffiliated withAutomated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science and Information Technology, The University of Nottingham
  • , Graham KendallAffiliated withAutomated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science and Information Technology, The University of Nottingham
  • , Eric SoubeigaAffiliated withAutomated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science and Information Technology, The University of Nottingham

* Final gross prices may vary according to local VAT.

Get Access

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