Hybrid Genetic Algorithms for University Course Timetabling

University course timetabling is one of the important and time consuming issues that each University is involved with it at the beginning of each. This problem is in class of NP-hard problem and is very difficult to solve by classic algorithms. Therefore optimization techniques are used to solve them and produce optimal or near optimal feasible solutions instead of exact solutions. Genetic algorithms, because of multidirectional search property of them, are considered as an efficient approach for solving this type of problems. In this paper three new hybrid genetic algorithms for solving the university course timetabling problem (UCTP) are proposed: FGARI, FGASA and FGATS. In proposed algorithms, fuzzy logic is used to measure violation of soft constraints in fitness function to deal with inherent uncertainly and vagueness involved in real life data. Also, randomized iterative local search, simulated annealing and tabu search are applied, respectively, to improve exploitive search ability and prevent genetic algorithm to be trapped in local optimum. The experimental results indicate that the proposed algorithms are able to produce promising results for the UCTP.

[1]  A. Alkan,et al.  Memetic algorithms for timetabling , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[2]  Sami Khuri,et al.  A grouping genetic algorithm for coloring the edges of graphs , 2000, SAC '00.

[3]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[4]  Kate A. Smith,et al.  Hopfield neural networks for timetabling: formulations, methods, and comparative results , 2003 .

[5]  Mohammad Saniee Abadeh,et al.  A fuzzy genetic algorithm with local search for university course timetabling , 2011, The 3rd International Conference on Data Mining and Intelligent Information Technology Applications.

[6]  Efthymios Housos,et al.  An integer programming formulation for a case study in university timetabling , 2004, Eur. J. Oper. Res..

[7]  Hadrien Cambazard,et al.  Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming , 2004, PATAT.

[8]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[9]  Kajal De,et al.  Fuzzy Genetic Heuristic for University Course Timetable Problem , 2010 .

[10]  Edmund K. Burke,et al.  Analyzing the landscape of a graph based hyper-heuristic for timetabling problems , 2009, GECCO.

[11]  Ben Paechter,et al.  A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem , 2002, PATAT.

[12]  Panagiotis Stamatopoulos,et al.  A Generic Object-Oriented Constraint-Based Model for University Course Timetabling , 2000, PATAT.

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

[14]  Huub M. M. ten Eikelder,et al.  Some Complexity Aspects of Secondary School Timetabling Problems , 2000, PATAT.

[15]  Sol Broder,et al.  Final examination scheduling , 1964, Commun. ACM.

[16]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

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

[18]  Shengxiang Yang,et al.  Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

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