Grammar-based genetic programming for timetabling

Mohamed Bader, R. Poli

Research output: Contribution to conferencePaperpeer-review

95 Downloads (Pure)

Abstract

We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for producing new generations is based on graph colouring heuristics that have previously proved to be effective in constructing timetables as well as different slot allocation heuristics. The framework is tested on a widely used benchmarks in the field of exam time-tabling and compared with highly-tuned state-of-the- art approaches. Results shows that the framework is very competitive with other constructive techniques.
Original languageEnglish
Pages2532-2539
Number of pages8
Publication statusPublished - 18 May 2009
Event2009 IEEE Congress on Evolutionary Computation - Trondheim, Norway
Duration: 18 May 200921 May 2009

Conference

Conference2009 IEEE Congress on Evolutionary Computation
Country/TerritoryNorway
CityTrondheim
Period18/05/0921/05/09

Keywords

  • hyperheuristics
  • hyper-heuristic

Fingerprint

Dive into the research topics of 'Grammar-based genetic programming for timetabling'. Together they form a unique fingerprint.

Cite this