Design and implementation of course timetabling system based on genetic algorithm

University course timetabling is one of the most important and time-consuming problem which takes place frequently in all the educational institutes. This paper proposes design and implementation system to generate timetable based on genetic algorithm using different combinations selection algorithm and mutation types. Two cases small problem and big problem are studied. The results show that two cases tournament selection is giving solutions better than roulette wheel Selection. The worst pair is roulette wheel selection and mutation. Mutation error method helps to reach to the best solution faster. In case of conflicts and no solution, our system generates a report, containing conflict constraints that must be remove or modified.

[1]  David C. Rich,et al.  A Smart Genetic Algorithm for University Timetabling , 1995, PATAT.

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

[3]  Peter J. Stuckey,et al.  New integer linear programming approaches for course timetabling , 2008, Comput. Oper. Res..

[4]  Christopher Head,et al.  A heuristic approach to simultaneous course/student timetabling , 2007, Comput. Oper. Res..

[5]  Abdelaziz Dammak,et al.  Classroom assignment for exam timetabling , 2006, Adv. Eng. Softw..

[6]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[7]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[8]  David Abramson,et al.  Simulated Annealing Cooling Schedules for the School Timetabling Problem , 1999 .

[9]  Patrick De Causmaecker,et al.  A decomposed metaheuristic approach for a real-world university timetabling problem , 2009, Eur. J. Oper. Res..

[10]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[11]  A. Araisa Mahiba,et al.  Genetic Algorithm with Search Bank Strategies for University Course Timetabling Problem , 2012 .

[12]  D. de Werra.  Graphs, hypergraphs and timetabling , 1985 .

[13]  Wilhelm Erben,et al.  A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling , 2000, PATAT.

[14]  Gilbert Laporte,et al.  Recent Developments in Practical Examination Timetabling , 1995, PATAT.

[15]  Kathryn A. Dowsland,et al.  A robust simulated annealing based examination timetabling system , 1998, Comput. Oper. Res..

[16]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

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

[18]  Peter J. Angeline,et al.  Adaptive and Self-adaptive Evolutionary Computations , 1995 .

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

[20]  David Corne,et al.  Evolutionary Timetabling: Practice, Prospects and Work in Progress , 1994 .

[21]  Edmund K. Burke,et al.  A University Timetabling System Based on Graph Colouring and Constraint Manipulation , 1994 .

[22]  David Abramson,et al.  A PARALLEL GENETIC ALGORITHM FOR SOLVING THE SCHOOL TIMETABLING PROBLEM , 1992 .

[23]  Christine M. Anderson-Cook.  Practical Genetic Algorithms (2nd ed.) , 2005 .