Examination Timetabling with Fuzzy Constraints

The aim of this paper is to consider flexible constraint satisfaction in timetabling problems. The research is carried out in the context of university examination timetabling. Examination timetabling is subject to two types of constraints: hard constraints that must not be violated, and soft constraints that often have to be violated to some extent. Usually, an objective function is introduced to measure the satisfaction of soft constraints in the solution by summing up the number of students involved in the violation of the constraint. In existing timetabling models the binary logic strategy is employed to handle the satisfaction of the constraints, i.e. a constraint is either satisfied or not. However, there are some constraints that are difficult to evaluate using the binary logic: for example, the constraint that large exams should be scheduled early in the timetable. Fuzzy IF–THEN rules are defined to derive the satisfaction degree of this constraint, where both the size of the exam and the time period that the exams are scheduled in are expressed using the linguistic descriptors Small, Medium and Large, and Early, Middle and Late, respectively. In a similar way, the constraint that students should have enough break between two exams is modelled. A number of memetic algorithms with different characteristics are developed where corresponding fitness functions aggregate the satisfaction degrees of both fuzzy constraints. The proposed approach is tested on real-world benchmark problems and the results obtained are discussed.

[1]  Michael Negnevitsky,et al.  Artificial Intelligence: A Guide to Intelligent Systems , 2001 .

[2]  Sanja Petrovic,et al.  Case-Based Initialisation of Metaheuristics for Examination Timetabling , 2005 .

[3]  Sanja Petrovic,et al.  A Novel Similarity Measure for Heuristic Selection in Examination Timetabling , 2004, PATAT.

[4]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[5]  Luca Di Gaspero,et al.  Tabu Search Techniques for Examination Timetabling , 2000, PATAT.

[6]  Sanja Petrovic,et al.  A time-predefined local search approach to exam timetabling problems , 2004 .

[7]  Lotfi A. Zadeh,et al.  Fuzzy Sets , 1996, Inf. Control..

[8]  Edmund K. Burke,et al.  Solving Examination Timetabling Problems through Adaption of Heuristic Orderings , 2004, Ann. Oper. Res..

[9]  W. Pedrycz,et al.  An introduction to fuzzy sets : analysis and design , 1998 .

[10]  Edmund K. Burke,et al.  Initialization Strategies and Diversity in Evolutionary Timetabling , 1998, Evolutionary Computation.

[11]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[12]  Sanja Petrovic,et al.  A Multiobjective Optimisation Technique for Exam Timetabling Based on Trajectories , 2002, PATAT.

[13]  Henri Prade,et al.  A Computational Approach to Approximate and Plausible Reasoning with Applications to Expert Systems , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Peter Ross,et al.  Some Observations about GA-Based Exam Timetabling , 1997, PATAT.

[15]  Hishammuddin Asmuni,et al.  Fuzzy Multiple Heuristic Orderings for Examination Timetabling , 2004, PATAT.

[16]  Edmund K. Burke,et al.  A multistage evolutionary algorithm for the timetable problem , 1999, IEEE Trans. Evol. Comput..

[17]  Anthony Wren,et al.  Scheduling, Timetabling and Rostering - A Special Relationship? , 1995, PATAT.

[18]  Sanja Petrovic,et al.  A Multicriteria Approach to Examination Timetabling , 2000, PATAT.

[19]  Maciej Hapke,et al.  Scheduling under Fuzziness , 2000 .

[20]  George M. White,et al.  Using tabu search with longer-term memory and relaxation to create examination timetables , 2004, Eur. J. Oper. Res..

[21]  Edmund K. Burke,et al.  The Design of Memetic Algorithms for Scheduling and Timetabling Problems , 2005 .

[22]  Gilbert Laporte,et al.  Examination timetabling by computer , 1982, Comput. Oper. Res..

[23]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[24]  Kathryn A. Dowsland,et al.  Variants of simulated annealing for the examination timetabling problem , 1996, Ann. Oper. Res..

[25]  Harald Meyer auf'm Hofe Solving Rostering Tasks as Constraint Optimization , 2000, PATAT.

[26]  George J. Klir,et al.  Fuzzy sets, uncertainty and information , 1988 .

[27]  Carlos M. Fonseca,et al.  A Study of Examination Timetabling with Multiobjective Evolutionary Algorithms , 2001 .

[28]  Edmund K. Burke,et al.  A Memetic Algorithm for University Exam Timetabling , 1995, PATAT.

[29]  Hishammuddin Asmuni,et al.  Fuzzy Multiple Ordering Criteria for Examination Timetabling , 2004 .

[30]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[31]  Sanja Petrovic,et al.  An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling , 2004, Metaheuristics for Multiobjective Optimisation.

[32]  Lotfi A. Zadeh,et al.  A Theory of Approximate Reasoning , 1979 .

[33]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.

[34]  Edmund K. Burke,et al.  Examination Timetabling in British Universities: A Survey , 1995, PATAT.

[35]  Edmund Ph. D. Burke,et al.  Practice and Theory of Automated Timetabling III: Third International Conference, PATAT 2000 Konstanz, Germany, August 16-18, 2000 Selected Papers , 2001 .