| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 482.65 KB | Adobe PDF |
Advisor(s)
Abstract(s)
The problem of examination timetabling is studied in this work. We propose a hybrid solution heuristic based on the Shuffled Frog-Leaping Algorithm (SFLA) for minimising the conflicts in the students's exams. The hybrid algorithm, named Hybrid SFLA (HSFLA), improves a population of frogs (solutions) by iteratively optimising each memeplex, and then shuffling the memeplexes in order to distribute the best performing frogs by the memeplexes. In each iteration the frogs are improved based on three operators: crossover and mutation operators, and a local search operator based on the Simulated Annealing metaheuristic. For the mutation and local search, we use two well known neighbourhood structures. The performance of the proposed method is evaluated on the 13 instances of the Toronto datasets from the literature. Computational results show that the HSFLA is competitive with state-of-the-art methods, obtaining the best results on average in seven of the 13 instances.
Description
Keywords
Examination timetabling Memetic algorithm Shuffled Frog-Leaping Algorithm Simulated annealing Toronto benchmarks
Citation
LEITE, Nuno; MELÍCIO, Fernando; ROSA, Agostinho C. – A hybrid shuffled frog-leaping algorithm for the university examination timetabling problem. Computational Intelligence – IJCCI 2013. ISSN 1860-949X. Vol. 613 (2016), pp. 173-188
Publisher
Springer