Skip to content
Research Article Open access CC BY 4.0

A Mathematical Programming Model and Enhanced Simulated Annealing Algorithm for the School Timetabling Problem

O. A. Odeniyi, E. O. Omidiora, S. O. Olabiyisi, C. A. Oyeleye

Asian Journal of Research in Computer Science · pp. 21–38 · Published 2 May 2020

10.9734/ajrcos/2020/v5i330136

Abstract

Despite significant research efforts for School Timetabling Problem (STP) and other timetabling problems, an effective solution approach (model and algorithm) which provides boundless use and high quality solution has not been developed. Hence, this paper presents a novel solution approach for solving school timetabling problem which characterizes the problem-setting in the timetabling problem of the high school system in Nigeria. We developed a mixed integer linear programming model and meta-heuristic method - Enhanced Simulated Annealing (ESA) algorithm. Our method incorporates specific features of Simulated Annealing (SA) and Genetic Algorithms (GA) in order to solve the school timetabling problem. Both our solution approach and SA approach were implemented using Matrix Laboratory 8.6 software. In order to validate and demonstrate the performance of the developed solution approach, it was tested with the highly constrained school timetabling datasets provided by a Nigerian high school using constraints violation, simulation time and solution cost as evaluation metrics. Our developed solution approach is able to find optimal solution as it satisfied all the specified hard and soft constraints with average simulation time of 37.91 and 42.16 seconds and solution cost of 17.03 and 18.99, respectively, for JSS and SSS to the problem instance. A comparison with results obtained with SA approach shows that the developed solution approach produced optimal solution in smaller simulation time and solution cost, and has a great potential to solve school timetabling problems with satisfactory results. The developed ESA algorithm can be used for solving other related optimization problems.

School timetabling problem model mixed integer linear programming meta-heuristics genetic algorithm simulated annealing.

Cited by 9

Conflict-Free School Timetabling Using Graph Coloring and Hybrid Metaheuristic Algorithms

M. Jain, Sharanabasappa Raikoti, Samuvel J Bala · 2025 International Conference on Information, Implementation, and Innovation in Technology (I2ITCON) · 2025

Automating School Timetabling: An Intelligent System Application Using Simulated Annealing

Tio Arya Dewa Prakasa, A. Muklason, I. Gusti Agung Premananda · International Seminar on Intelligent Technology and Its Applications · 2024

An Effective Local Particle Swarm Optimization-Based Algorithm for Solving the School Timetabling Problem

Frank Werner, Ioannis X. Tassopoulos, Christina A. Iliopoulou · Algorithms · 2023

How to Assess Different Algorithms Using Intuitionistic Fuzzy Logic

T. Pencheva, Maria Angelova, E. Sotirova · Mathematics · 2021

A Mathematical Model for the Optimization of Timetable Scheduling Problem of an Educational Institution

M. Akkilic, Eren Ozceylan · Proceedings of the International Conference on Industrial Engineering and Operations Management · 2021

A survey of the state-of-the-art of optimisation methodologies in school timetabling problems

Joo Siang Tan, S. Goh, G. Kendall · Expert systems with applications · 2021

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

9

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.