Time table generator: Using Genetic Algorithm

The design of the automated timetabling system is based on overcoming the complexities associated with educational scheduling. The traditional method of construction of the schedule involves considerable time consumption and is also likely to be in conflict, resulting in suboptimal utilization of resources. This problem is overcome by a hybrid optimization strategy that combines genetic algorithms with local search techniques and models of constraint satisfaction. Such an approach allows for the inclusion of various constraints, categorized into hard constraints, such as the presence of faculty, room capacity, and course clashes, and soft constraints, which include student preferences and minimal idle time.It would then represent the timetables as chromosomes within the genetic algorithm and enable scheduling to evolve iteratively using crossover and mutation operations. It is further refined by local search techniques that minimize the number of conflicts in the generated timetables. Actual test at NMIMS Mukesh Patel was carried out in order to demonstrate that with the capabilities of the resource allocation, the conflict rates would be reduced and hence at the minimum level of human interference. The results of the experiment are a good indicator of effectiveness and malleability of the developed solution - the productive system of timetabling for large academic institutions.