Optimizing Timetable Scheduling: A Smart Local Search Approach With Aspiration and Random Moves Strategies

View at publisher Summarise with VIRAT
Authors: Drifa Hadjidj, Rachid Hadjidj, Abdelhak Belhi, Razika Belkacemi, Habiba Drias
Cited by: 0
References: 38

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This paper presents the Smart Local Search (SLS) algorithm, a hybrid metaheuristic framework for the NP-hard examination timetabling problem. SLS distinctively integrates graph-based construction heuristics with a guided local search framework, enhanced by an aspiration criterion to recover promising solutions overlooked by penalty terms and a strategic random move mechanism to escape local optima. Extensive experiments on all 11 of Carter’s widely used benchmark datasets show that SLS achieves competitive results, with an average penalty of 28.03 and a standard deviation of 42.30 across the benchmarks. Statistical significance testing (Wilcoxon signed-rank test, α = 0.05) confirms that SLS’s performance is significantly better than most baseline methods (p-value−10). The algorithm demonstrates particular strength in stability and consistency, making it a robust and efficient solution for complex educational scheduling environments.

Fields of Study & Subjects

Scheduling and Timetabling Solutions Constraint Satisfaction and Optimization Metaheuristic Optimization Algorithms Research

Publication details

Journal / source
IEEE Transactions on Automation Science and Engineering
Volume
23
Pages
7000–7012
Publication date
1 January 2026
Language
EN