Using Tabu search with multi-neighborhood structures to solve University Course Timetable UKM case study (faculty of engineering)

In this work we apply a Tabu search and multi-neighborhood structure to solve University Course Timetable at the faculty of engineering, University Kebangsan Malaysia. The aim is to introduce the neighborhood structure according to the difference between the lengths of lectures (i.e. some lectures are one hour, while others are two hours). Therefore, the new neighborhood structure is required to handle this problem. The results have demonstrate the effectiveness of the proposed neighborhood structure.