Next Article in Journal
Economic Dispatch Using Modified Bat Algorithm
Next Article in Special Issue
A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem
Previous Article in Journal
Group Sparse Reconstruction of Multi-Dimensional Spectroscopic Imaging in Human Brain in vivo
Previous Article in Special Issue
Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
Article Menu

Export Article

Open AccessArticle

Solving the Examination Timetabling Problem in GPUs

Computer Systems Laboratory, Department of Electrical and Computer Engineering,University of Patras, GR-26504 Patras, Greece
Technological Educational Institute of Epirus, GR-48100 Preveza, Greece
Technological Educational Institute of Western Greece, GR-30020 Antirio, Greece
Author to whom correspondence should be addressed.
Algorithms 2014, 7(3), 295-327;
Received: 27 March 2014 / Revised: 22 May 2014 / Accepted: 12 June 2014 / Published: 3 July 2014
(This article belongs to the Special Issue Bio-inspired Algorithms for Combinatorial Problems)
PDF [503 KB, uploaded 3 July 2014]


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. View Full-Text
Keywords: evolutionary algorithms; examination timetabling problem; GPU computing; CUDA evolutionary algorithms; examination timetabling problem; GPU computing; CUDA
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Kolonias, V.; Goulas, G.; Gogos, C.; Alefragis, P.; Housos, E. Solving the Examination Timetabling Problem in GPUs. Algorithms 2014, 7, 295-327.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top