Timetable Generation using Value Encoding and Different Selection Methodsin Genetic Algorithm

Abstract

This paper describes techniques that can be applied on timetable problems. Timetable is explained as, essentially, a schedule with constraints. Timetable is the used to organize the schedule in timely manner or in organized list form. Timetable generation is the Constraint Satisfaction Problem. In this paper, we explain the approach to design and implement Genetic Algorithm to create the institute course based timetables. Institute course timetabling is the NPhard problem; timetables are usually designed manually, taking several days or week of iterative repair to meet several constraints. Using Evolutionary technique like Genetic Algorithm, it’s been seen that the Genetic Algorithm could be improved by further incorporation of repair strategies, and is readily scalable to the complete timetabling problem. In this paper, we generate the timetable with the help of the encoding techniques used in Genetic Algorithm and apply the various selection methods.