Comparing hybrid constructive heuristics for university course timetabling
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 ar...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/32603/ |
| Summary: | 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. |
|---|