DocumentCode :
1641729
Title :
Grammar-based genetic programming for timetabling
Author :
El Den, Mohamed Bader ; Poli, Riccardo
Author_Institution :
Dept. of Comput. Sci., Loughborough Univ., Loughborough
fYear :
2009
Firstpage :
2532
Lastpage :
2539
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.
Keywords :
genetic algorithms; grammars; graph colouring; constructive heuristics; grammar-based genetic programming; graph colouring heuristics; slot allocation heuristics; timetabling problem; Benchmark testing; Computer science; Educational programs; Genetic algorithms; Genetic engineering; Genetic programming; Helium; Problem-solving; Space exploration; Uncertainty;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2009. CEC '09. IEEE Congress on
Conference_Location :
Trondheim
Print_ISBN :
978-1-4244-2958-5
Electronic_ISBN :
978-1-4244-2959-2
Type :
conf
DOI :
10.1109/CEC.2009.4983259
Filename :
4983259
Link To Document :
بازگشت