An evolutionary non-linear great deluge approach for solving course timetabling problems

Rayner Alfred, and Joe Henry Obit, and Djamila Ouelhadj, and Dario Landa-Silva, (2012) An evolutionary non-linear great deluge approach for solving course timetabling problems. IJCSI International Journal of Computer Science Issues. pp. 269-276. ISSN 1694-0814


Download (44kB) | Preview


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.

Item Type: Article
Uncontrolled Keywords: Evolutionary Algorithm, Non-linear Great Deluge and Course Timetabling
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: FACULTY > Faculty of Computing and Informatics
Depositing User: Unnamed user with email
Date Deposited: 26 Nov 2015 03:04
Last Modified: 12 Oct 2017 07:43

Actions (login required)

View Item View Item