Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling

The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable rooms. The design of course timetables for academic institutions is a very difficult task because it is an NP-hard problem. This paper investigates genetic algorithms (GAs) with a guided search strategy and local search (LS) techniques for the UCTP. The guided search strategy is used to create offspring into the population based on a data structure that stores information extracted from good individuals of previous generations. The LS techniques use their exploitive search ability to improve the search efficiency of the proposed GAs and the quality of individuals. The proposed GAs are tested on two sets of benchmark problems in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed GAs are able to produce promising results for the UCTP.

[1]  D. Landa-Silva,et al.  Great deluge with non-linear decay rate for solving course timetabling problems , 2008, 2008 4th International IEEE Conference Intelligent Systems.

[2]  Adli Mustafa,et al.  Artificial Immune Algorithms for University Timetabling , 2006 .

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

[4]  Yuri Bykov.  The Description of the Algorithm for International Timetabling Competition , 2003 .

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

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

[7]  Piero P. Bonissone,et al.  Evolutionary algorithms + domain knowledge = real-world evolutionary computation , 2006, IEEE Transactions on Evolutionary Computation.

[8]  Edmund K. Burke,et al.  A hybrid evolutionary approach to the university course timetabling problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[10]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[11]  Algorithm Description , 2007 .

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

[13]  Luca Di Gaspero,et al.  Timetabling Competition TTComp 2002: Solver Description , 2003 .

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

[15]  Calvin C. Gotlieb,et al.  The Construction of Class-Teacher Time-Tables , 1962, IFIP Congress.

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

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

[18]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[19]  Edmund K. Burke,et al.  A survey of search methodologies and automated system development for examination timetabling , 2009, J. Sched..

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

[21]  Shengxiang Yang,et al.  A guided search genetic algorithm for the university course timetabling problem. , 2009 .

[22]  Halvard Arntzen,et al.  A Tabu Search Heuristic for a University Timetabling Problem , 2005 .

[23]  S. Deris,et al.  A Study on PSO-Based University Course Timetabling Problem , 2009, 2009 International Conference on Advanced Computer Control.

[24]  Ben Paechter,et al.  A local search for the timetabling problem , 2002 .

[25]  Barry McCollum,et al.  University Timetabling: Bridging the Gap between Research and Practice , 2006 .

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

[27]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

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

[29]  H. Asmuni.  Fuzzy multiple heuristic orderings for course timetabling , 2005 .

[30]  Edmund K. Burke,et al.  Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem , 2007, Metaheuristics.

[31]  Marco Dorigo,et al.  Genetic Algorithms: A New Approach to the Timetable Problem , 1992 .

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

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

[34]  Edmund K. Burke,et al.  Automated University Timetabling: The State of the Art , 1997, Comput. J..

[35]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

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

[37]  Adnan Acan,et al.  Chromosome Reuse in Genetic Algorithms , 2003, GECCO.

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

[39]  Pupong Pongcharoen,et al.  Stochastic Optimisation Timetabling Tool for university course scheduling , 2008 .

[40]  Ben Paechter,et al.  Application of the Grouping Genetic Algorithm to University Course Timetabling , 2005, EvoCOP.