A Tabu-Search Hyperheuristic for Timetabling and Rostering

摘要: Hyperheuristics can be defined to heuristics which choose between in order solve a given optimisation problem. The main motivation behind the development of such approaches is goal developing automated scheduling methods are not restricted one In this paper we report investigation hyperheuristic approach and evaluate it on various instances two distinct timetabling rostering problems. framework our approach, compete using rules based principles reinforcement learning. A tabu list also maintained prevents certain from being chosen at times during search. We demonstrate that tabu-search an easily re-usable method produce solutions least acceptable quality across variety problems instances. effect proposed capable producing competitive with those obtained state-of-the-art problem-specific techniques for studied here, but fundamentally more general than techniques.