Javascript must be enabled to continue!
A matheuristic for customized multi-level multi-criteria university timetabling
View through CrossRef
Abstract
Course timetables are the organizational foundation of a university’s educational program. While students and lecturers perceive timetable quality individually according to their preferences, there are also collective criteria derived normatively such as balanced workloads or idle time avoidance. A recent challenge and opportunity in curriculum-based timetabling consists of customizing timetables with respect to individual student preferences and with respect to integrating online courses as part of modern course programs or in reaction to flexibility requirements as posed in pandemic situations. Curricula consisting of (large) lectures and (small) tutorials further open the possibility for optimizing not only the lecture and tutorial plan for all students but also the assignments of individual students to tutorial slots. In this paper, we develop a multi-level planning process for university timetabling: On the tactical level, a lecture and tutorial plan is determined for a set of study programs; on the operational level, individual timetables are generated for each student interlacing the lecture plan through a selection of tutorials from the tutorial plan favoring individual preferences. We utilize this mathematical-programming-based planning process as part of a matheuristic which implements a genetic algorithm in order to improve lecture plans, tutorial plans, and individual timetables so as to find an overall university program with well-balanced timetable performance criteria. Since the evaluation of the fitness function amounts to invoking the entire planning process, we additionally provide a proxy in the form of an artificial neural network metamodel. Computational results exhibit the procedure’s capability of generating high quality schedules.
Springer Science and Business Media LLC
Title: A matheuristic for customized multi-level multi-criteria university timetabling
Description:
Abstract
Course timetables are the organizational foundation of a university’s educational program.
While students and lecturers perceive timetable quality individually according to their preferences, there are also collective criteria derived normatively such as balanced workloads or idle time avoidance.
A recent challenge and opportunity in curriculum-based timetabling consists of customizing timetables with respect to individual student preferences and with respect to integrating online courses as part of modern course programs or in reaction to flexibility requirements as posed in pandemic situations.
Curricula consisting of (large) lectures and (small) tutorials further open the possibility for optimizing not only the lecture and tutorial plan for all students but also the assignments of individual students to tutorial slots.
In this paper, we develop a multi-level planning process for university timetabling: On the tactical level, a lecture and tutorial plan is determined for a set of study programs; on the operational level, individual timetables are generated for each student interlacing the lecture plan through a selection of tutorials from the tutorial plan favoring individual preferences.
We utilize this mathematical-programming-based planning process as part of a matheuristic which implements a genetic algorithm in order to improve lecture plans, tutorial plans, and individual timetables so as to find an overall university program with well-balanced timetable performance criteria.
Since the evaluation of the fitness function amounts to invoking the entire planning process, we additionally provide a proxy in the form of an artificial neural network metamodel.
Computational results exhibit the procedure’s capability of generating high quality schedules.
Related Results
Ant colony optimisation for solving university course timetabling problems
Ant colony optimisation for solving university course timetabling problems
Course timetabling is one of the most important activities faced by any educational institution. Furthermore, the course timetabling process is time-consuming and tiresome as it ne...
An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem
An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem
AbstractIn this paper, we propose an adaptive large neighborhood search-based matheuristic algorithm to solve a multi-product many-to-many maritime inventory routing problem. The p...
Optimization in University Student Timetables: A Comprehensive Literature Review
Optimization in University Student Timetables: A Comprehensive Literature Review
The University Course Timetabling Problem presents a complex optimization problem as it seeks to meet the diverse requirements and constraints of a university's academic program th...
A Comparative Study of Modern Heuristics on the School Timetabling Problem
A Comparative Study of Modern Heuristics on the School Timetabling Problem
In this contribution a comparative study of modern heuristics on the school timetabling problem is presented. More precisely, we investigate the application of two population-based...
Implementation of a Tabu search heuristic for the examinations timetabling problem
Implementation of a Tabu search heuristic for the examinations timetabling problem
This paper reports on the design and implementation of an algorithm for the construction of an examinations timetable. The Examinations Timetabling Problem is the problem of assign...
Parameter Tuning for Local-Search-Based Matheuristic Methods
Parameter Tuning for Local-Search-Based Matheuristic Methods
Algorithms that aim to solve optimisation problems by combining heuristics and mathematical programming have attracted researchers’ attention. These methods, also known as matheuri...
A study on optimization methods for solving course timetabling problem in university
A study on optimization methods for solving course timetabling problem in university
Course timetabling is one of the most important processes faced by any educational institution. However, the course timetabling process is time consuming and tiresome as it needs t...
Dynamic Timetabling Using Reactive Constraint Agents
Dynamic Timetabling Using Reactive Constraint Agents
Kebanyakan teknik yang diimplimentasi bagi menyelesaikan masalah penjadualan tertumpu kepada proses yang statik. Walau bagaimanapun, di dalam dunia sebenar, masalah penjadualan mer...

