Robust university course timetabling problem subject to single and multiple disruptions

Gülcü, Ayla; Akkan, Can

doi:10.1016/j.ejor.2019.11.024

Cited by 27 publications

(11 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Heuristic techniques that find satisfactory solutions to the Examination and Course timetabling problems have also been extensively investigated [12,13,4,14]. Implementation of some of these algorithms are available as packages, for example, DEAP -Distributed Evolutionary Algorithms in Python [15] is a python implementation of the Genetic algorithm.…”

Section: Methodsmentioning

confidence: 99%

Meta-Heuristic Solutions to a Student Grouping Optimization Problem faced in Higher Education Institutions

Kenekayoro

Fawei

2020

JAMCS

View full text Add to dashboard Cite

Combinatorial problems which have been proven to be NP-hard are faced in Higher Education Institutions and researches have extensively investigated some of the well-known combinatorial problems such as the timetabling and student project allocation problems. However, NP-hard problems faced in Higher Education Institutions are not only confined to these categories of combinatorial problems. The majority of NP-hard problems faced in institutions involve grouping students and/or resources, albeit with each problem having its own unique set of constraints. Thus, it can be argued that techniques to solve NP-hard problems in Higher Education Institutions can be transferred across the different problem categories. As no method is guaranteed tooutperform all others in all problems, it is necessary to investigate heuristic techniques for solving lesser-known problems in order to guide stakeholders or software developers to the most appropriate algorithm for each unique class of NP-hard problems faced in Higher Education Institutions. To this end, this study described an optimization problem faced in a real university that involved grouping students for the presentation of semester results. Ordering based heuristics, genetic algorithm and the ant colony optimization algorithm implemented in Python programming language were used to find feasible solutions to this problem, with the ant colony optimization algorithm performing better or equal in 75% of the test instances and the genetic algorithm producing better or equal results in 38% of the test instances.

show abstract

Section: Methodsmentioning

confidence: 99%

Meta-Heuristic Solutions to a Student Grouping Optimization Problem faced in Higher Education Institutions

Kenekayoro

Fawei

2020

JAMCS

View full text Add to dashboard Cite

show abstract

“…In contrast, exam scheduling discusses a certain amount of time in a limited number of rooms. Research on course scheduling was carried out by [6], [7], [8], [9], [10]. Meanwhile, [11], and [12] discussed exam scheduling.…”

Section: Literature Reviewmentioning

confidence: 99%

Bibliometric Analysis of University Timetabling Using Publish and Perish

Trenggonowati¹,

Herlina²,

Febianti³

et al. 2022

Proceedings of the Conference on Broad Exposure to Science and Technology 2021 (BEST 2021)

View full text Add to dashboard Cite

The University Course Timetabling Problem (UCTP) is rated as the main enemy by the University. UCTP aims to allocate academic courses to lecturers, the division of time, and classrooms that must carry out regularly. So that learning activities run well and smoothly until achieving an increase in the quality of education. This study recommends bibliometric analysis for this problem. Doing this is necessary to see trends or research gaps that are still possible. Search data using Publish and perish software, while data analysis using VOSviewer software. The search and data analysis results show that trend for the university timetabling problem is more likely to be solved by metaheuristic models such as genetic algorithms and simulated annealing.

show abstract

“…Its performance was better, on average, compared to other algorithms in the scientific literature. [36] proposed a Multi-Objective Simulated Annealing (MOSA) in tackling the UCTTP. They aimed to define a good Pareto front by taking into consideration the solution quality and the robustness of the solution.…”

Section: Hyper-heuristicmentioning

confidence: 99%

“…As UCTTP is unique across institutions due to policies and regulatory requirements, it is difficult if not impossible, to compare solution approaches objectively [36]. This has led to the introduction of international timetabling competitions.…”

Section: Research Opportunities In Ucttpmentioning

confidence: 99%

A Survey of University Course Timetabling Problem: Perspectives, Trends and Opportunities

et al. 2021

View full text Add to dashboard Cite

The timetabling problem is common to academic institutions such as schools, colleges or universities. It is a very hard combinatorial optimisation problem which attracts the interest of many researchers. The university course timetabling problem (UCTTP) is difficult to address due to the size of the problem and several challenging hard and soft constraints. Over the years, various methodologies were proposed to solve UCTTP. The purpose of this survey paper is to provide the most recent scientific review of the methodologies applied to UCTTP. The paper unveils a classification of methodologies proposed in recent years based on chronology and datasets used. Perspectives, trends, challenges and opportunities in UCTTP are also presented. It is observed that meta-heuristic approaches are popular among researchers. This is followed closely by hybrid methodologies. Hyper-heuristic approaches are also able to produce effective results. Another observation is that the state-of-art methodologies in the scientific literature are not fully utilised in a real-world environment perhaps due to the limited flexibility of these methodologies. INDEX TERMS combinatorial optimisation problem, course timetabling problem, optimisationThis article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication.

show abstract

Robust university course timetabling problem subject to single and multiple disruptions

Cited by 27 publications

References 28 publications

Meta-Heuristic Solutions to a Student Grouping Optimization Problem faced in Higher Education Institutions

Meta-Heuristic Solutions to a Student Grouping Optimization Problem faced in Higher Education Institutions

Bibliometric Analysis of University Timetabling Using Publish and Perish

A Survey of University Course Timetabling Problem: Perspectives, Trends and Opportunities

Contact Info

Product

Resources

About