Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues

University timetabling problems are a yearly challenging task and are faced repeatedly each semester. The problems are considered nonpolynomial time (NP) and combinatorial optimization problems (COP), which means that they can be solved through optimization algorithms to produce the aspired optimal...

Full description

Saved in:
Bibliographic Details
Main Authors: Bashab, Abeer, Ibrahim, Ashraf Osman, Hashem, Ibrahim Abakar Tarigo, Aggarwal, Karan, Mukhlif, Fadhil, A. Ghaleb, Fuad, Abdelmaboud, Abdelzahir
Format: Article
Language:English
Published: Tech Science Press 2023
Subjects:
Online Access:http://eprints.utm.my/106432/1/FuadAbdulgaleel2023_OptimizationTechniquesinUniversityTimetablingProblem.pdf
http://eprints.utm.my/106432/
http://dx.doi.org/10.32604/cmc.2023.034051
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.106432
record_format eprints
spelling my.utm.1064322024-06-30T06:11:57Z http://eprints.utm.my/106432/ Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues Bashab, Abeer Ibrahim, Ashraf Osman Hashem, Ibrahim Abakar Tarigo Aggarwal, Karan Mukhlif, Fadhil A. Ghaleb, Fuad Abdelmaboud, Abdelzahir QA75 Electronic computers. Computer science University timetabling problems are a yearly challenging task and are faced repeatedly each semester. The problems are considered nonpolynomial time (NP) and combinatorial optimization problems (COP), which means that they can be solved through optimization algorithms to produce the aspired optimal timetable. Several techniques have been used to solve university timetabling problems, and most of them use optimization techniques. This paper provides a comprehensive review of the most recent studies dealing with concepts, methodologies, optimization, benchmarks, and open issues of university timetabling problems. The comprehensive review starts by presenting the essence of university timetabling as NP-COP, defining and clarifying the two formed classes of university timetabling: University Course Timetabling and University Examination Timetabling, illustrating the adopted algorithms for solving such a problem, elaborating the university timetabling constraints to be considered achieving the optimal timetable, and explaining how to analyze and measure the performance of the optimization algorithms by demonstrating the commonly used benchmark datasets for the evaluation. It is noted that meta-heuristic methodologies are widely used in the literature. Additionally, recently, multi-objective optimization has been increasingly used in solving such a problem that can identify robust university timetabling solutions. Finally, trends and future directions in university timetabling problems are provided. This paper provides good information for students, researchers, and specialists interested in this area of research. The challenges and possibilities for future research prospects are also explored. Tech Science Press 2023 Article PeerReviewed application/pdf en http://eprints.utm.my/106432/1/FuadAbdulgaleel2023_OptimizationTechniquesinUniversityTimetablingProblem.pdf Bashab, Abeer and Ibrahim, Ashraf Osman and Hashem, Ibrahim Abakar Tarigo and Aggarwal, Karan and Mukhlif, Fadhil and A. Ghaleb, Fuad and Abdelmaboud, Abdelzahir (2023) Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues. Computers, Materials and Continua, 74 (3). pp. 6461-6484. ISSN 1546-2218 http://dx.doi.org/10.32604/cmc.2023.034051 DOI : 10.32604/cmc.2023.034051
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Bashab, Abeer
Ibrahim, Ashraf Osman
Hashem, Ibrahim Abakar Tarigo
Aggarwal, Karan
Mukhlif, Fadhil
A. Ghaleb, Fuad
Abdelmaboud, Abdelzahir
Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues
description University timetabling problems are a yearly challenging task and are faced repeatedly each semester. The problems are considered nonpolynomial time (NP) and combinatorial optimization problems (COP), which means that they can be solved through optimization algorithms to produce the aspired optimal timetable. Several techniques have been used to solve university timetabling problems, and most of them use optimization techniques. This paper provides a comprehensive review of the most recent studies dealing with concepts, methodologies, optimization, benchmarks, and open issues of university timetabling problems. The comprehensive review starts by presenting the essence of university timetabling as NP-COP, defining and clarifying the two formed classes of university timetabling: University Course Timetabling and University Examination Timetabling, illustrating the adopted algorithms for solving such a problem, elaborating the university timetabling constraints to be considered achieving the optimal timetable, and explaining how to analyze and measure the performance of the optimization algorithms by demonstrating the commonly used benchmark datasets for the evaluation. It is noted that meta-heuristic methodologies are widely used in the literature. Additionally, recently, multi-objective optimization has been increasingly used in solving such a problem that can identify robust university timetabling solutions. Finally, trends and future directions in university timetabling problems are provided. This paper provides good information for students, researchers, and specialists interested in this area of research. The challenges and possibilities for future research prospects are also explored.
format Article
author Bashab, Abeer
Ibrahim, Ashraf Osman
Hashem, Ibrahim Abakar Tarigo
Aggarwal, Karan
Mukhlif, Fadhil
A. Ghaleb, Fuad
Abdelmaboud, Abdelzahir
author_facet Bashab, Abeer
Ibrahim, Ashraf Osman
Hashem, Ibrahim Abakar Tarigo
Aggarwal, Karan
Mukhlif, Fadhil
A. Ghaleb, Fuad
Abdelmaboud, Abdelzahir
author_sort Bashab, Abeer
title Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues
title_short Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues
title_full Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues
title_fullStr Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues
title_full_unstemmed Optimization techniques in university timetabling problem: Constraints, methodologies, benchmarks, and open issues
title_sort optimization techniques in university timetabling problem: constraints, methodologies, benchmarks, and open issues
publisher Tech Science Press
publishDate 2023
url http://eprints.utm.my/106432/1/FuadAbdulgaleel2023_OptimizationTechniquesinUniversityTimetablingProblem.pdf
http://eprints.utm.my/106432/
http://dx.doi.org/10.32604/cmc.2023.034051
_version_ 1803335005964861440
score 13.160551