Solving Class Timetabling Problem of IIT Kanpur using Multi-Objective Evolutionary Algorithm

Unlike in many other universities, preparation of class timetable in IIT Kanpur is very laborious and complicated. It contains different types of classes, among which most of the common classes are either split or grouped. Many split classes are divided up to five parts, while many sets of group classes contain up to twenty classes. The entire timetable is composed of two phases. The first phase contains all the common compulsory classes of the institute, which are scheduled by a central team. The second phase contains the individual departmental classes. Presently this timetable is prepared manually, by manipulating those of earlier years, with the only aim of producing a feasible timetable. The potentiality of evolutionary algorithms (EAs) have been exploited in the present work to schedule the classes of the first phase of the problem. Using NSGA-II-UCTO, a multi-objective EA-based university class timetable optimizer, a number of trade-off solutions, in terms of multiple objectives of the problem, could be obtained very easily. Moreover, each of the obtained solutions has been found much better than a manually prepared solution which is in use.

[1]  A. Luiz,et al.  An Integer Programming Model for the School Timetabling Problem , 2006 .

[2]  Tim Fischer,et al.  Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results , 2001, EvoWorkshops.

[3]  Onno B. de Gans,et al.  A computer timetabling system for secondary schools in the Netherlands , 1981 .

[4]  Kalyanmoy Deb,et al.  Multi-Objective Evolutionary Algorithm for University Class Timetabling Problem , 2007, Evolutionary Scheduling.

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

[6]  Margarida Vaz Pato,et al.  A Multiobjective Genetic Algorithm for the Class/Teacher Timetabling Problem , 2000, PATAT.

[7]  Kalyanmoy Deb,et al.  Optimization for Engineering Design: Algorithms and Examples , 2004 .

[8]  Agostinho Rosa,et al.  Two neighbourhood approaches to the timetabling problem , 2004 .

[9]  Andrea Schaerf,et al.  REPORT RAPPORT , 2022 .

[10]  Chee-Kit Looi,et al.  Neural network methods in combinatorial optimization , 1992, Comput. Oper. Res..

[11]  Marco Dorigo,et al.  Genetic Algorithms and Highly Constrained Problems: The Time-Table Case , 1990, PPSN.

[12]  Alberto Colorni,et al.  A genetic algorithm to solve the timetable problem , 1992 .

[13]  Roberto Piola Evolutionary solutions to a highly constrained combinatorial problem , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[14]  Ben Paechter,et al.  An hyperheuristic approach to course timetabling problem using an evolutionary algorithm , .

[15]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[16]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[17]  Ben Paechter,et al.  A GA Evolving Instructions for a Timetable Builder , 2002 .

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

[19]  D. de Werra Construction of School Timetables by Flow Methods. , 1971 .

[20]  Margarida Vaz Pato,et al.  A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem , 2004, Eur. J. Oper. Res..

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

[22]  Dipti Srinivasan,et al.  Automated time table generation using multiple context reasoning for university modules , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[23]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..