Solving the Examination Timetabling Problem in GPUs

Algorithms

Vasileios Kolonias³  George Goulas³  Christos Gogos²  Panayiotis Alefragis¹ 

[1] Technological Educational Institute of Western Greece, GR-30020 Antirio, Greece; E-Mail:;Technological Educational Institute of Epirus, GR-48100 Preveza, Greece; E-Mail:;Computer Systems Laboratory, Department of Electrical and Computer Engineering, University of Patras, GR-26504 Patras, Greece; E-Mails:

关键词: evolutionary algorithms;    examination timetabling problem;    GPU computing;    CUDA;   

DOI  :  10.3390/a7030295

来源: mdpi

【 摘 要 】

The examination timetabling problem belongs to the class of combinatorial optimization problems and is of great importance for every University. In this paper, a hybrid evolutionary algorithm running on a GPU is employed to solve the examination timetabling problem. The hybrid evolutionary algorithm proposed has a genetic algorithm component and a greedy steepest descent component. The GPU computational capabilities allow the use of very large population sizes, leading to a more thorough exploration of the problem solution space. The GPU implementation, depending on the size of the problem, is up to twenty six times faster than the identical single-threaded CPU implementation of the algorithm. The algorithm is evaluated with the well known Toronto datasets and compares well with the best results found in the bibliography. Moreover, the selection of the encoding of the chromosomes and the tournament selection size as the population grows are examined and optimized. The compressed sparse row format is used for the conflict matrix and was proven essential to the process, since most of the datasets have a small conflict density, which translates into an extremely sparse matrix.

【 授权许可】

CC BY   
© 2014 by the authors; licensee MDPI, Basel, Switzerland.