University Course Timetabling problem using Novel Genetic Algorithm

The issue of university course timetables for academic institutions is one of the most important and time-consuming problems. To solve this problem, it should be subject to the hard and soft constraints are attributed to time. The course is tabulated in the schedule of courses for the teachers and students predefined time (usually one week), so that a set of constraints and limitations respect. Solving this problem requires the hand of time, usually several days of work of an individual or group manager. In addition, the proposed solution may be some limitations and constraints manually are not satisfied. To solve the above problems in the time, many attempts have been made. Over the past few years, many papers have been published to solve this problem. In addition, several applications have been developed and successfully applied. This paper presents a Genetic Algorithm (GA) for solving the university course timetabling problem (UCTP). The experimental results indicate that the proposed Genetic algorithm is efficient for solving the UCTP.

کلیدواژه ها:

University Course Timetabling ، Genetics Algorithm ، NP-Complete