A decomposed metaheuristic approach for a real-world university timetabling problem |
| |
Authors: | Patrick De Causmaecker Peter Demeester Greet Vanden Berghe |
| |
Institution: | 1. KaHo Sint-Lieven, Information Technology, Gebroeders Desmetstraat 1, 9000 Gent, Belgium;2. Katholieke Universiteit Leuven Campus Kortrijk, Computer Science and Information Technology, Etienne Sabbelaan 53, 8500 Kortrijk, Belgium |
| |
Abstract: | In this paper we present a decomposed metaheuristic approach to solve a real-world university course timetabling problem. Essential in this problem are the overlapping time slots and the irregular weekly timetables. A first stage in the approach reduces the number of subjects through the introduction of new structures that we call ‘pillars’. The next stages involve a metaheuristic search that attempts to solve the constraints one by one, instead of trying to find a solution for all the constraints at once. Test results for a real-world instance are presented. |
| |
Keywords: | Metaheuristics Timetabling Tabu search Decomposed heuristic |
本文献已被 ScienceDirect 等数据库收录! |