A Genetic Algorithm for the Real-world University Course Timetabling Problem
In this work, we propose a Genetic Algorithm (GA) in addressing a post enrolment course timetabling (PECTT) problem for University Malaysia Sabah-Labuan International Campus (UMS-LIC). Tabu Search with Sampling and Perturbation (TSSP) is used to initiate a pool of feasible solutions in the GA. Exper...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | en en |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://eprints.ums.edu.my/id/eprint/33870/1/A%20Genetic%20Algorithm%20for%20the%20Real-world%20University%20Course%20Timetabling%20Problem.pdf https://eprints.ums.edu.my/id/eprint/33870/3/A%20Genetic%20Algorithm%20for%20the%20Real-world%20University%20Course%20Timetabling%20Problem%20_ABSTRACT.pdf https://eprints.ums.edu.my/id/eprint/33870/ https://ieeexplore.ieee.org/document/9781907 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this work, we propose a Genetic Algorithm (GA) in addressing a post enrolment course timetabling (PECTT) problem for University Malaysia Sabah-Labuan International Campus (UMS-LIC). Tabu Search with Sampling and Perturbation (TSSP) is used to initiate a pool of feasible solutions in the GA. Experiments are conducted to set the best parameter values for the algorithm to operate optimally under a computation time limit. The proposed methodology is tested on a dataset based on semester 1, session 2018/2019 student registration. The automated timetables are compared with the one generated manually by the administrative staff of UMS-LIC. The former outperformed the latter in terms of hard and soft constraint violations (approximately 54% improvement). Experimental results are discussed. |
|---|