Variable Neighborhood Decomposition Search
Journal of Heuristics
Distributed Branch and Bound Algorithm in Coalition Planning
Proceedings of the 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001 on Multi-Agent-Systems and Applications II-Selected Revised Papers
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A survey of automated timetabling
A survey of automated timetabling
A multistage evolutionary algorithm for the timetable problem
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
This paper presents a model of generalized timetabling problem and a decomposition algorithm which can decompose large problems into independent smaller subproblems—the search for a feasible solution can then be easily parallelized. The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types [9]. Course timetabling is a multi-dimensional NP-complete problem [4]. In this paper we present the multi-resource timetabling problem (MRTP), our model for the generalized high-school timetabling problem. The MRTP is a search problem—a feasible solution is searched. The main contribution of this paper is the Decomposition Algorithm for MRTP to parallelize the search, so the whole MRTP can be easily distributed and parallelized. Our approach was applied to real-life instances of high-school timetabling problems. Results are discussed at the end of this paper and parallelized search is compared with the centralized one.