Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results.

Annals of Operations Research (Impact Factor: 1.03). 01/2012; 194:59-70. DOI: 10.1007/s10479-010-0707-0
Source: DBLP

ABSTRACT We propose a set of formulations for the Curriculum-Based Course Timetabling problem, with the aim of “capturing” many real-world
formulations, and thus encouraging researchers to “reduce” their specific problems to one of them, gaining the opportunity
to compare and assess their results. This work is accompanied by a web application that maintains all the necessary infrastructures for benchmarking: validators, data formats, instances, reference scores, lower bounds, solutions, and visualizers. All instances
proposed here are based on real data from various universities and they represent a variety of possible situations.

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, harmony search algorithm is applied to curriculum-based course timetabling. The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment. In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory. This research used the highest occurrence of the course number to be scheduled in a new harmony. The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. Each course scheduled out of memory consideration is examined as to whether it should be pitch adjusted with probability of eight procedures. However, the algorithm produced results that were not comparatively better than those previously known as best solution. With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Timetabling is the task of assigning sets of events to periods of time, taking into account resource-constraints and preferences among assignments. It is a well-studied field of research and is generally recog-nized to be a hard problem, both from the perspective of encoding it as from a computational point of view. In recent years, there has been increased interest in combining efficient search algorithms with modelling languages capable of high-level rep-resentations of real-world domains. Research into such systems is con-ducted, a.o., in the fields of Constraint Programming and Knowledge Representation. In this paper, we investigate the use of the modelling language of first-order logic extended with constructs such as aggregates, types, definitions and arithmetic, and the idp system, which implements model generation for this language, to the timetabling problem. We show the feasibility of the approach and argue that there are impor-tant advantages both from the modelling point of view, leading to nat-ural representation of the problem, and from the solving point of view, taking advantage of efficient automated search techniques like SAT and constraint propagation.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A branch-and-cut procedure for the Udine Course Timetabling problem is described. Simple compact integer linear programming formulations of the problem employ only binary variables. In contrast, we give a formulation with fewer variables by using a mix of binary and general integer variables. This formulation has an exponential number of constraints, which are added only upon violation. The number of constraints is exponential. However, this is only with respect to the upper bound on the general integer variables, which is the number of periods per day in the Udine Course Timetabling problem. A number of further classes of cuts are also introduced, arising from: enumeration of event/free-period patterns; bounds on the numbers of days of instruction; the desire to exploit integrality of the objective function value; the graph colouring component; and also from various implied bounds. An implementation of the corresponding branch-and-cut procedure is evaluated on the instances from Track 3 of the International Timetabling Competition 2007. KeywordsInteger programming–Branch-and-cut–Cutting planes–Soft constraints–Educational timetabling–University course timetabling
    Annals of Operations Research 01/2012; 194(1):71-87. · 1.03 Impact Factor

Full-text (2 Sources)

Available from
May 27, 2014