Benchmarking Curriculum-Based Course Timetabling: Formulations, Data Formats, Instances, Validation, and Results
01/2008; In proceeding of: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2008)
[show abstract] [hide abstract]
ABSTRACT: The course timetabling problem deals with the assignment of a set of courses to specific timeslots and rooms within a working week subject to a variety of hard and soft constraints. Solutions are called feasible if all the hard constraints are satisfied. The goal is to satisfy as many of the soft constraints as possible whilst constructing a feasible schedule. In this paper, we present a combination of two metaheuristics i.e. great deluge and tabu search approaches. The algorithm is tested over eleven benchmark datasets (representing one large, five medium and five small problems). The results demonstrate that our approach is able to produce solutions that have lower penalty on all the small and medium problems when compared against other techniques from the literature.
Conference Proceeding: A Critical Element-Guided Perturbation Strategy for Iterated Local Search.Evolutionary Computation in Combinatorial Optimization, 9th European Conference, EvoCOP 2009, Tübingen, Germany, April 15-17, 2009. Proceedings; 01/2009
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.