Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling

In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive search. These smaller parts comprise a combination of choosing a method to select a task to be scheduled and a method to allocate resources, including time, to the selected task. We use reduced Variable Neighbourhood Search (rVNS) and hyperheuristic approaches to decide which sub problems to tackle. The resulting methods are compared to local search and Genetic Algorithm approaches. Parallelisation is used to perform nearly one CPU-year of experiments. The results show that the new methods can produce results fitter than the Genetic Algorithm in less time and that they are far superior to any of their component techniques. The method used to split up the problem is generalisable and could be applied to a wide range of optimisation problems.

• Type: Conference
• Year: 2007
• Where: EVOW
• Authors: Stephen Remde, Peter I. Cowling, Keshav P. Dahal, Nic Colledge
• Keywords: Artificial Intelligence, EVOW 2007, Genetic Algorithm, Smaller Parts, Workforce Scheduling Problem