A systematic mapping study on solving university timetabling problems using meta-heuristic algorithms

Abstract

Since university timetabling is commonly classified as a combinatorial optimisation problem, researchers tend to use optimisation approaches to reach the optimal timetable solution. Meta-heuristic algorithms have been presented as effective solutions as proven on their leverage over the last decade. Extensive literature studies have been published until today. However, a comprehensive systematic overview is missing. Therefore, this mapping study aimed to provide an organised view of the current state of the field and comprehensive awareness of the meta-heuristic approaches, by conducting meta-heuristic for solving university timetabling problems. In addition, the mapping study tried to highlight the intensity of publications over the last years, spotting the current trends and directions in the field of solving university timetabling problems, as well as having the work to provide guidance for future research by indicating the gaps and open questions to be fulfilled. Primary studies on mapping study that have been published in the last decade from 2009 until the first quarter of 2020, which consist of 131 publications, were selected as a benchmark for future research to solve university timetabling problems using meta-heuristic algorithms. The majority of the articles based on the publication type are hybrid methods (32%), in which the distribution of meta-heuristic algorithms the hybrid algorithms represent the higher application (31%). Likewise, the majority of the research is solution proposals (66%). The result of this study confirmed the efficiency and intensive application of the meta-heuristic algorithms in solving university timetabling problems, specifically the hybrid algorithms. A new trend of meta-heuristic algorithms such as grey wolf optimiser, cat swarm optimisation algorithm, Elitist self-adaptive step-size search and others with high expectations for reliable and satisfying results can be proposed to fill this gap.

Review and analysis of existing methods of scheduling classes

“…Ол тез шешім қабылдау қабілетін дәлелдеді. Алайда, дәйекті эвристикалық тәсілдердің тиімділігі Мета-эвристиканың тиімділігімен салыстырғанда салыстырмалы түрде әлсіз [1]. Жергілікті іздеу эвристикалық алгоритмдердің бір мысалы болып табылады және келесідей сипатталады: LS-комбинаторлық оңтайландыру (COPs) есептерін шешуге арналған функционалды алгоритм.…”

An Evolutionary Algorithm: An Enhancement of Binary Tournament Selection for Fish Feed Formulation

“…EAs are easy to apply and often provide satisfactory solutions compared with other global optimization techniques. According to Fogel [1]; Burke and Kendall [69]; Grosan and Abraham [60]; Rahman [6]; Abd Rahman et al [7]; Rahman et al [8]; Hien and Gillis [70]; Bashab et al [71]; and Ojstersek et al [61]; EAs can be applied to problems where heuristics solutions lead to unsatisfactory results due to EA has global search characteristics. Terefore, EAs have been widely used for practical problem-solving, even in feed formulation.…”

A course scheduling model based on academic title-based preferences and deviations- a case study of industrial engineering department

“…Pek çok analitik tekniğin yanı sıra, ele alınan problemin hesaplama karmaşıklığı (NP-zor), araştırmacıları sezgisel ve meta-sezgisel gibi alternatif yöntemlere de yönlendirmiştir. Bu yaklaşımlar en iyi çözümü garanti etmese de, oldukça iyi performans gösterirler [9]. Bu kısımda, ders çizelgeleme literatüründe, son yıllarda önde gelen çalışmalar özetlenmiştir: Gunawan ve diğ.…”