Bipartite graph edge coloring approach to course timetabling

Course timetabling problem is common in schools and higher learning institutions. Courses must be allocated to teachers/lecturers, students, timeslots and venues without violating a set of predefined constraints determined by the respective institution. The problem is complex due to the different requirements set by the institutions and the process of finding a solution can be lengthy and time-consuming. This paper presents our research findings on implementing a bipartite graph edge coloring approach in solving a course timetabling problem. The data set used in this study is gathered from the Department of Information Technology in a Private College. Three data sets (from three different semesters) were tested in our experiment. The results are analyzed by comparing the total penalties of violation on a set of predefined soft constraints between the current timetable (produced manually) and the timetable from our prototype developed. The results from experimental research showed that the bipartite graph edge coloring approach on the course timetabling problem in this case study was able to reduce the penalties, thus producing better quality timetable compared to the manual timetable. In future research, more experiments can be conducted using the bipartite graph edge coloring approach with larger scope of data sets.

[1]  Jeffrey H. Kingston,et al.  Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem , 2002, PATAT.

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

[3]  Daniel A. Marcus.  Graph Theory: A Problem Oriented Approach , 2008 .

[4]  Andrew Lim,et al.  Heuristics for the exam scheduling problem , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

[5]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling II , 1997, Lecture Notes in Computer Science.

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

[7]  Tim Wahls,et al.  The course scheduling problem as a source of student projects , 2005, SIGCSE.

[8]  Tim Wahls,et al.  The course scheduling problem as a source of student projects , 2005 .

[9]  J. Gross,et al.  Graph Theory and Its Applications , 1998 .

[10]  George M. White,et al.  Examination Timetables and Tabu Search with Longer-Term Memory , 2000, PATAT.

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

[12]  Carlos Cotta,et al.  Memetic Algorithms in Planning, Scheduling, and Timetabling , 2007, Evolutionary Scheduling.

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

[14]  Wolfgang Banzhaf,et al.  A Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem , 2007, EPIA Workshops.

[15]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[16]  Geoffrey C. Fox,et al.  A Comparison of Annealing Techniques for Academic Course Scheduling , 1997, PATAT.

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

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

[19]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

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

[21]  Sanja Petrovic,et al.  Case-based selection of initialisation heuristics for metaheuristic examination timetabling , 2007, Expert Syst. Appl..