TIMETABLE GENERATION USING GENETIC ALGORITHM FOR BATCHES UNDER A P J ABDUL KALAM TECHNOLOGICAL UNIVERSITY

The problem of scheduling a timetable is a complex job that is considered as an NP-hard problem, i.e., not verifiable in polynomial time. This is a typical scheduling problem that appears to be a strenuous job in every academic institute. The Genetic Algorithm, being an adaptive algorithm, can improve its efficiency as it progresses. A timetable should satisfy a particular number of constraints that are specific to the organization that it has been subjected to. Here, the university that is associated with our college, Kerala Technological University (KTU), has just been established and it is essential to have a timetable scheduler of its own to ease the burden of colleges to specify its norms and amount of subjects it deals with every year.