A fuzzy genetic algorithm with local search for university course timetabling

University course timetabling is one of the most important and time-consuming problems in all educational institutions. 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 are considered as an efficient approach for solving this type of problems. This paper presents a fuzzy genetic algorithm (GA) with a local search for solving university course timetabling problem (UCTP). The local search is applied to use its exploitive search ability to improve the search efficiency of the proposed GA. 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. The experimental results indicate that the proposed GA is able to produce promising results for the UTCP.

[1]  Edmund K. Burke,et al.  Applications to timetabling , 2004 .

[2]  Michael W. Carter,et al.  A Lagrangian Relaxation Approach To The Classroom Assignment Problem , 1989 .

[3]  Nguyen Due Thanh.  Solving Timetabling Problem Using Genetic and Heuristic Algorithms , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

[4]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[5]  Masri Ayob,et al.  Hybrid Ant Colony systems for course timetabling problems , 2009, 2009 2nd Conference on Data Mining and Optimization.

[6]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[7]  Mohammed Azmi Al-Betar,et al.  A harmony search algorithm for university course timetabling , 2010, Annals of Operations Research.

[8]  Rhyd Lewis,et al.  A survey of metaheuristic-based techniques for University Timetabling problems , 2007, OR Spectr..

[9]  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).

[10]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

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

[12]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

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

[14]  Regina Berretta,et al.  A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem , 2007, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007).

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

[16]  S. Abdullah,et al.  Generating University Course Timetable Using Genetic Algorithms and Local Search , 2008, 2008 Third International Conference on Convergence and Hybrid Information Technology.

[17]  Mauro Birattari,et al.  An effective hybrid algorithm for university course timetabling , 2006, J. Sched..

[18]  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..

[19]  Safaai Deris,et al.  University timetabling by constraint-based reasoning: A case study , 1997 .

[20]  Shengxiang Yang,et al.  A Memetic Algorithm for the University Course Timetabling Problem , 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.