Title: A hybrid algorithm for university course timetabling problem
Abstract: A hybrid algorithm combining the genetic algorithm with the iterated local search algorithm is developed for solving university course timetabling problem. This hybrid algorithm combines the merits of genetic algorithm and iterated local search algorithm for its convergence to global optima at the same time avoiding being get trapped into local optima. This leads to intensification of the involved search space for solutions. It is applied on a number of benchmark university course timetabling problem instances of various complexities. Keywords: timetabling, optimization, metaheuristics, genetic algorithm, iterative local search
Publication Year: 2015
Publication Date: 2015-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 11
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot