You are here:

Examination scheduling by constraint programming
THESIS

, Ecole Polytechnique, Montreal , Canada

Ecole Polytechnique, Montreal . Awarded

Abstract

The aim of this thesis is to develop a new application to solve the examination scheduling problem for École Polytechnique de Montréal.

This thesis adopts constraint programming as the method to solve the problem. First the model of the problem is constructed, then the problem is divided into two sub-problems, and solved in two phases: examination-session timetabling problem and examination-room timetabling problem. In order to improve the run-time performance, different methods are investigated to reduce the search space so that only the right sub-spaces are explored during the search. Additionally, different search control algorithms are used to improve the performance further and to find out where the algorithms are likely to make a wrong choice.

The results of experiments show that several algorithms could find better solutions and one of them had a better run-time performance. The algorithm is very stable, we tested it by using three sets of data. Comparing with the results from École Polytechnique de Montréal, it would seem that our results are very good. (Abstract shortened by UMI.)

Citation

Yang, X. Examination scheduling by constraint programming. Master's thesis, Ecole Polytechnique, Montreal. Retrieved October 23, 2019 from .

This record was imported from ProQuest on October 23, 2013. [Original Record]

Citation reproduced with permission of ProQuest LLC.

For copies of dissertations and theses: (800) 521-0600/(734) 761-4700 or https://dissexpress.umi.com

Keywords