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/ |
| _version_ | 1848794447082422272 |
|---|---|
| author | Landa-Silva, Dario Obit, Joe Henry |
| author_facet | Landa-Silva, Dario Obit, Joe Henry |
| author_sort | Landa-Silva, Dario |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:16:20Z |
| format | Conference or Workshop Item |
| id | nottingham-32603 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:16:20Z |
| publishDate | 2011 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-326032020-05-04T20:23:18Z https://eprints.nottingham.ac.uk/32603/ Comparing hybrid constructive heuristics for university course timetabling Landa-Silva, Dario Obit, Joe Henry 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. 2011-05 Conference or Workshop Item PeerReviewed Landa-Silva, Dario and Obit, Joe Henry (2011) Comparing hybrid constructive heuristics for university course timetabling. In: VII ALIO/EURO Workshop on Applied Combinatorial Optimization, May 4 - 6, 2011, Porto, Portugal. Course timetabling heuristics metaheuristics initialisation strategies |
| spellingShingle | Course timetabling heuristics metaheuristics initialisation strategies Landa-Silva, Dario Obit, Joe Henry Comparing hybrid constructive heuristics for university course timetabling |
| title | Comparing hybrid constructive heuristics for university course timetabling |
| title_full | Comparing hybrid constructive heuristics for university course timetabling |
| title_fullStr | Comparing hybrid constructive heuristics for university course timetabling |
| title_full_unstemmed | Comparing hybrid constructive heuristics for university course timetabling |
| title_short | Comparing hybrid constructive heuristics for university course timetabling |
| title_sort | comparing hybrid constructive heuristics for university course timetabling |
| topic | Course timetabling heuristics metaheuristics initialisation strategies |
| url | https://eprints.nottingham.ac.uk/32603/ |