A Fuzzy Solution Based on Memetic Algorithms for Timetabling

Timetabling constitutes one of the common issues concerning the field of programming especially that of educational systems. It is categorized as NP-complete matter for which using intelligent algorithms seems inevitable. The present article aims to offer a fuzzy solution based on memetic algorithms to solve timetable problems. As such, such a solution was compared with memetic and genetic algorithms. The results of the study show that the suggested method may satisfy the existing constraints simultaneously and in a shorter amount of time.