DMCA
A Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem
| Citations: | 6 - 2 self |
BibTeX
@MISC{Pillay_agenetic,
author = {Nelishia Pillay and Wolfgang Banzhaf},
title = {A Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second takes an indirect approach to the problem and examines the generation of heuristics or combinations of heuristics, i.e. hyper-heuristics, to be used in the construction of examination timetables. The study presented in this paper focuses on the latter area. This paper presents a first attempt at using genetic programming for the evolution of hyper-heuristics for the uncapacitated examination timetabling problem. The system has been tested on 9 benchmark examination timetabling problems. Clash-free timetables were found for all 9 nine problems. Furthermore, the performance of the genetic programming system is comparable to, and in a number of cases has produced better quality timetables, than other search algorithms used to evolve hyper-heuristics for this set of problems.
Keyphrases
uncapacitated examination timetabling problem genetic programming approach examination timetable first attempt genetic programming genetic programming system latter area various methodology examination timetabling quality timetable uncapacitated examination benchmark examination indirect approach search algorithm clash-free timetable
