Grammar-based genetic programming for timetabling

Authors:
Mohamed Bader El Den;Riccardo Poli
Affiliations:
Department of Computer Science, Loughborough University, Loughborough, UK and Department of Computer Science and Electronic Engineering, University of Essex, Colchester, UK;Department of Computer Science and Electronic Engineering, University of Essex, Colchester, UK
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 9
Cited 1

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Foundations of genetic programming

Foundations of genetic programming
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
Case-based heuristic selection for timetabling problems

Journal of Scheduling
An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Inc*: an incremental approach for improving local search heuristics

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Generating SAT local-search heuristics using a GP hyper-heuristic framework

EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
A Field Guide to Genetic Programming

A Field Guide to Genetic Programming
Fuzzy multiple heuristic orderings for examination timetabling

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling

Evolutionary algorithms using cluster patterns for timetabling

Intelligent Decision Technologies

Quantified Score

Hi-index	0.00

Visualization

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.