1Omar Ibrahim Obaid, 2MohdSharifuddin Ahmad, 3 Salama A. Mostafa, 4Mazin Abed Mohammed
الملخص العربي
In this paper, a genetic-based approach to examination timetable scheduling problem is presented. In particular, the variations that are observed in the Genetic Algorithm (GA) performance in generating possible timetables are studied. A timetable with binary representation is applied with several operators with the aim of preventing the violation of the fundamental constraints. The algorithm is guaranteed to always produce a feasible solution by satisfying the hard constraints. It utilizes one-point and two-point crossover operators and propagates distinctive timetable features to generate better solutions even for complex cases. However, different operators and their impact on the quality of the timetables are also demonstrated. It is found that GA influence can be affected by adjustment to its parameters.
تاريخ النشر
10/03/2012
الناشر
Journal of Emerging Trends in Computing and Information Sciences
الكلمات المفتاحية
Examination timetabling, hard and soft constraints, genetic algorithm
مازن الشجيري | Mazin AL-Shujeary | 13027