Memetic algorithms for solving university course timetabling problem

Abstract

In this paper we propose two memetic algorithms for the university course timetabling problem. First by using graph coloring heuristics a new crossover method is proposed. Then to hybridize the genetic algorithm, a local search method with a mechanism similar to hill climbing is defined. The proposed memetic algorithms are applied on some datasets and their performance are compared with each other. The obtained results demonstrate that the first memetic algorithm has a better performance than the second one. Also a saturation degree heuristic is utilized in the crossover which improves the performances of the memetic algorithms. Comparison of the obtained results with the results reported in the literature demonstrates the comparability of our proposed algorithms with already existing algorithms.

An Improved Saturation Degree-Based Constructive Heuristic for Master Surgery Scheduling Problem: Case Study

“…Various studies have also explored combinations of these heuristics [56][57][58][59][60]. Additionally, these heuristics have been integrated into various metaheuristic algorithms [61][62][63][64] and hyper-heuristic frameworks [65][66][67]. Constructive heuristics are also widely applied to solve diverse optimization problems, such as the Travelling Salesman Problem [68], flowshop scheduling [69], personnel scheduling [70], staff scheduling [71], and machine assembly scheduling [72].…”