Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
