Comparing hybrid constructive heuristics for university course timetabling

Landa-Silva, Dario; Obit, Joe Henry

Abstract

This extended abstract outlines four hybrid heuristics to generate initial solutions to the University course timetabling problem. These hybrid approaches combine graph colouring heuristics and local search in different ways. Results of experiments using two benchmark datasets from the literature are presented. All the four hybrid initialisation heuristics described here are capable of generating feasible initial timetables for all the test problems considered in these experiments.

Citation

Landa-Silva, D., & Obit, J. H. (2011). Comparing hybrid constructive heuristics for university course timetabling.

• Conference Name: VII ALIO/EURO Workshop on Applied Combinatorial Optimization
• End Date: May 6, 2011
• Publication Date: May 1, 2011
• Deposit Date: Apr 4, 2016
• Publicly Available Date: Apr 4, 2016
• Peer Reviewed: Peer Reviewed
• Keywords: Course timetabling, heuristics metaheuristics, initialisation strategies
• Public URL: https://nottingham-repository.worktribe.com/output/1010005