Meta-heuristic approaches for the University course timetabling problem

Sina Abdipoor and Razali Yaakob and Say leng goh and Salwani Abdullah (2023) Meta-heuristic approaches for the University course timetabling problem. Intelligent Systems with Applications, 19. pp. 1-18.

[img] Text
ABSTRACT.pdf

Download (37kB)
[img] Text
FULL TEXT.pdf
Restricted to Registered users only

Download (1MB) | Request a copy

Abstract

Course timetabling is an ongoing challenge that universities face all around the world. This combinatorial optimization task involves allocating a set of events into finite time slots and rooms while attempting to satisfy a set of predefined constraints. Given the high number of constraints and the large solution space to be explored, the University Course Timetabling Problem (UCTP) is classified as an NP-hard problem. Meta-heuristic approaches have been commonly applied to this problem in the literature and have achieved high performance on benchmark datasets. This survey paper provides a comprehensive and systematic review of these approaches in the UCTP. It reviews, summarizes, and categorizes the approaches, and introduces a classification for hybrid meta-heuristic methods. Furthermore, it critically analyzes the benefits and limitations of the methods. It also presents challenges, gaps, and possible future work.

Item Type: Article
Keyword: Operational research Combinatorial optimization University Course Timetabling Problem Meta-heuristics Hybrid meta-heuristics
Subjects: Q Science > QA Mathematics > QA1-939 Mathematics > QA71-90 Instruments and machines > QA75-76.95 Calculating machines
T Technology > T Technology (General) > T1-995 Technology (General) > T55.4-60.8 Industrial engineering. Management engineering > T57-57.97 Applied mathematics. Quantitative methods
Department: FACULTY > Faculty of Computing and Informatics
Depositing User: ABDULLAH BIN SABUDIN -
Date Deposited: 09 Feb 2024 11:15
Last Modified: 09 Feb 2024 11:15
URI: https://eprints.ums.edu.my/id/eprint/38208

Actions (login required)

View Item View Item