An Evolutionary Non-Linear Great Deluge Approach for Solving Course Timetabling Problems

• Published in: International journal of computer science issues Vol. 9; no. 4; p. 1
• Main Authors: Obit, Joe Henry, Ouelhadj, Djamila, Landa-Silva, Dario, Alfred, Rayner
• Format: Journal Article
• Language: English
• Published: Mahebourg International Journal of Computer Science Issues (IJCSI) 01.07.2012
• Subjects: Algorithms; Combinatorial analysis; Computer science; Evolutionary; Evolutionary algorithms; Mathematical models; Mutations; Nonlinearity; Operators
• ISSN: 1694-0814; 1694-0784

The aim of this paper is to extend our non-linear great deluge algorithm into an evolutionary approach by incorporating a population and a mutation operator to solve the university course timetabling problems. This approach might be seen as a variation of memetic algorithms. The popularity of evolutionary computation approaches has increased and become an important technique in solving complex combinatorial optimisation problems. The proposed approach is an extension of a non-linear great deluge algorithm in which evolutionary operators are incorporated. First, we generate a population of feasible solutions using a tailored process that incorporates heuristics for graph colouring and assignment problems. The initialisation process is capable of producing feasible solutions even for large and most constrained problem instances. Then, the population of feasible timetables is subject to a steady-state evolutionary process that combines mutation and stochastic local search. We conducted experiments to evaluate the performance of the proposed algorithm and in particular, the contribution of the evolutionary operators. The results showed the effectiveness of the hybridisation between non-linear great deluge and evolutionary operators in solving university course timetabling problems.