MétaCan
← all works

Solving the Examination Timetabling Problem in GPUs

2014· article· en· 5 citations· W2080574925 on OpenAlex· 10.3390/a7030295

Why is this work in the frame?

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

About CanadaIts subject is Canada, wherever its authors sit.

No Canadian affiliation. An affiliation-only frame — the usual design — would never have seen this work. It is one of the works that make the case for inverting the frame.

The three-model screen

all 1,000 screened works →

All three models called this out of scope.

stratum: about_only · design weight: 3321.24 (the sample is stratified; any rate computed without the weight is wrong)
Claude Opus 4.8OUT
genre: empirical
about Canada: no
confidence: high

Uses a GPU hybrid evolutionary algorithm to solve exam timetabling; the object is an optimization algorithm.

GPT-5.6 (high)OUT
genre: empirical
about Canada: no
confidence: high

It develops an algorithm for examination timetabling, not a study of research.

Grok 4.5OUT
genre: empirical
about Canada: no
confidence: high

GPU algorithm for university exam timetabling; combinatorial optimization of schedules, not study of research.

Abstract

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.

Stored with the screening record, where it is evidence for the labels above.

The record

Venue
Algorithms
Topic
Scheduling and Timetabling Solutions
Field
Decision Sciences
Canadian institutions
Funders
Keywords
Computer scienceComponent (thermodynamics)Selection (genetic algorithm)Tournament selectionGreedy algorithmPopulationGenetic algorithmEvolutionary algorithmMathematical optimizationProcess (computing)Matrix (chemical analysis)Class (philosophy)AlgorithmArtificial intelligenceMachine learningMathematics
Has abstract in OpenAlex
yes