Title: A hybrid modified cuckoo search algorithm for the uncapacitated examination timetabling

Authors: Meryem Cheraitia; Rewayda Razaq Abo Alsabeh

Addresses: LabSTIC, 8 Mai 1945 University, Guelma, Algeria ' Department of Mathematics, Faculty of Computer Science and Mathematic, University of Kufa, Iraq

Abstract: In this study, we investigate the effectiveness of cuckoo search algorithm (CSA) for solving the uncapacitated examination timetabling problem (UETTP). CSA is a popular metaheuristic optimisation algorithm that mimics the behaviour of cuckoos. Compared with other nature-inspired algorithms, it is more generic and robust for many optimisation problems. The CSA is easy to understand and implement. Furthermore, it represents a powerful search method with few controllable parameters and can be combined with additional strategies to increase effectiveness. We proposed a modified version of CSA. Moreover, a local search strategy is utilised to reinforce the CSA and improve the exploitation phase to develop and provide high-quality solutions. Extensive experiments were conducted using Carter benchmark datasets consisting of 12 instances selected from several real-world universities. The obtained results confirm that the hybrid modified CSA outperforms the basic CSA and it has comparable performance in comparison with other algorithms proposed in the literature.

Keywords: examination timetabling; metaheuristic; cuckoo search algorithm; CSA; simulated annealing.

DOI: 10.1504/IJMOR.2024.138528

International Journal of Mathematics in Operational Research, 2024 Vol.28 No.1, pp.40 - 59

Received: 03 Mar 2023
Accepted: 11 Mar 2023
Published online: 09 May 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article