TY - JOUR
T1 - Fairness in examination timetabling
T2 - Student preferences and extended formulations
AU - Muklason, Ahmad
AU - Parkes, Andrew J.
AU - Özcan, Ender
AU - McCollum, Barry
AU - McMullan, Paul
N1 - Publisher Copyright:
© 2017 Elsevier B.V.
PY - 2017/6/1
Y1 - 2017/6/1
N2 - Variations of the examination timetabling problem have been investigated by the research community for more than two decades. The common characteristic between all problems is the fact that the definitions and datasets used all originate from actual educational institutions, particularly universities, including specific examination criteria and the students involved. Although much has been achieved and published on the state-of-the-art problem modelling and optimisation, a lack of attention has been focussed on the students involved in the process. This work presents and utilises the results of an extensive survey seeking student preferences with regard to their individual examination timetables, with the aim of producing solutions which satisfy these preferences while still also satisfying all existing benchmark considerations. The study reveals one of the main concerns relates to fairness within the student's cohort; i.e. a student considers fairness with respect to the examination timetables of their immediate peers, as highly important. Considerations such as providing an equitable distribution of preparation time between all student cohort examinations, not just a majority, are used to form a measure of fairness. In order to satisfy this requirement, we propose an extension to the state-of-the-art examination timetabling problem models widely used in the scientific literature. Fairness is introduced as a new objective in addition to the standard objectives, creating a multi-objective problem. Several real-world examination data models are extended and the benchmarks for each are used in experimentation to determine the effectiveness of a multi-stage multi-objective approach based on weighted Tchebyceff scalarisation in improving fairness along with the other objectives. The results show that the proposed model and methods allow for the production of high quality timetable solutions while also providing a trade-off between the standard soft constraints and a desired fairness for each student.
AB - Variations of the examination timetabling problem have been investigated by the research community for more than two decades. The common characteristic between all problems is the fact that the definitions and datasets used all originate from actual educational institutions, particularly universities, including specific examination criteria and the students involved. Although much has been achieved and published on the state-of-the-art problem modelling and optimisation, a lack of attention has been focussed on the students involved in the process. This work presents and utilises the results of an extensive survey seeking student preferences with regard to their individual examination timetables, with the aim of producing solutions which satisfy these preferences while still also satisfying all existing benchmark considerations. The study reveals one of the main concerns relates to fairness within the student's cohort; i.e. a student considers fairness with respect to the examination timetables of their immediate peers, as highly important. Considerations such as providing an equitable distribution of preparation time between all student cohort examinations, not just a majority, are used to form a measure of fairness. In order to satisfy this requirement, we propose an extension to the state-of-the-art examination timetabling problem models widely used in the scientific literature. Fairness is introduced as a new objective in addition to the standard objectives, creating a multi-objective problem. Several real-world examination data models are extended and the benchmarks for each are used in experimentation to determine the effectiveness of a multi-stage multi-objective approach based on weighted Tchebyceff scalarisation in improving fairness along with the other objectives. The results show that the proposed model and methods allow for the production of high quality timetable solutions while also providing a trade-off between the standard soft constraints and a desired fairness for each student.
KW - Fairness
KW - Metaheuristic
KW - Multi-objective optimisation
KW - Timetabling
UR - http://www.scopus.com/inward/record.url?scp=85013763123&partnerID=8YFLogxK
U2 - 10.1016/j.asoc.2017.01.026
DO - 10.1016/j.asoc.2017.01.026
M3 - Article
AN - SCOPUS:85013763123
SN - 1568-4946
VL - 55
SP - 302
EP - 318
JO - Applied Soft Computing Journal
JF - Applied Soft Computing Journal
ER -