Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

School Timetabling Optimisation Using Artificial Bee Colony Algorithm Based on a Virtual Searching Space Method

Version 1 : Received: 6 November 2021 / Approved: 12 November 2021 / Online: 12 November 2021 (11:34:55 CET)

How to cite: Zhu, K.; Li, L.D.; Li, M. School Timetabling Optimisation Using Artificial Bee Colony Algorithm Based on a Virtual Searching Space Method. Preprints 2021, 2021110215 (doi: 10.20944/preprints202111.0215.v1). Zhu, K.; Li, L.D.; Li, M. School Timetabling Optimisation Using Artificial Bee Colony Algorithm Based on a Virtual Searching Space Method. Preprints 2021, 2021110215 (doi: 10.20944/preprints202111.0215.v1).

Abstract

Although educational timetabling problems have been studied for decades, one type, the STP, has not developed as quickly as the other two types due to its diversity and complexity. Also, most of the STP research has only focused on the educators’ availabilities when studying the educator aspect, and the educators’ preferences and expertise have not been taken into consideration. This paper proposes a conceptual model for the school timetabling problem considering educators’ availabilities, preferences and expertise as a whole, and chooses a common real-world school timetabling scenario to study. A mathematical model is presented. A Virtual search space for dealing with the large search space is introduced, and the artificial bee colony algorithm is adapted and applied to the proposed model. The proposed approach is simulated with a random-generated large dataset. The experimental results demonstrate that the proposed approach is able to solve the STP and handle a large dataset in an ordinary computer hardware environment, which significantly reduces computational costs. Compared to the traditional CP method, the proposed approach is more effective and can provide more satisfactory solutions in considering educators’ availabilities, preferences, and expertise levels.

Keywords

educational timetable; school timetabling; constraint satisfaction problem; optimisation; artificial bee colony algorithm

Subject

MATHEMATICS & COMPUTER SCIENCE, Artificial Intelligence & Robotics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.