Genetic Algorithm with Search Bank Strategies for University Course Timetabling Problem

University Course Timetabling Problem (UCTP) is a multi-assignment problem in which Students, Staff, and Subjects together as events are scheduled to suitable timeslots and assigned to available classrooms. The design of scheduling of Course Timetable of a University is a difficult task every semester. This paper proposes a new method of Genetic algorithm with Search Bank Strategies namely local, guided and tabu searches. Local Search is used to increase the offspring or solutions. Guided Search is used to narrow the solutions by using Events Data Structure. Tabu search is used to remove the used solutions. The newly proposed method gives promising results for UCTP.