A Modified Migrating Bird Optimization For University Course Timetabling Problem

University course timetabling problem is a dilemma which educational institutions are facing due tovarious demands to be achieved in limited resources. Migrating bird optimization (MBO) algorithm is anew meta-heuristic algorithm which is inspired by flying formation of migrating birds. It has been applied successfully in tackling quadratic assignment problem and credit cards fraud detection problem. However, it was reported that MBO will get stuck in local optima easily. Therefore, a modified migrating bird optimization algorithm is proposed to solve post enrolment-based course timetabling. An improved neighbourhood sharing mechanism is used with the aim of escaping from local optima. Besides that, iterated local search is selected to be hybridized with the migrating bird optimization in order to further enhance its exploitation ability. The proposed method was tested using Socha’s benchmark datasets. The experimental results show that the proposed method outperformed the basic MBO and it is capable of producing comparable results as compared with existing methods that have been presented in literature. Indeed, the proposed method is capable of addressing university course timetabling problem and promising results were obtained.