# Solving the Examination Timetabling Problem with the Shuffled Frog-leaping Algorithm

### Nuno Leite, Fernando Melício, Agostinho Rosa

#### Abstract

Shuffled Frog-Leaping Algorithm (SFLA) is a recently proposed memetic meta-heuristic algorithm for solving combinatorial optimisation problems. SFLA has both global and local search capabilities, and great convergence speed towards the global optimum. Compared to a genetic algorithm, the experimental results show an effective reduction of the number of evaluations required to find the global optimal solution. The Examination Timetabling Problem (ETTP) is a complex combinatorial optimisation problem faced by schools and universities every epoch. In this work, we apply the Shuffled Frog-Leaping Algorithm to solve the ETTP. The evolution step of the algorithm, specifically the local exploration in the submemeplex is carefully adapted based on the prototype SFLA. The algorithm was evaluated on the standard Toronto benchmark instances, and the preliminary experimental results obtained are comparable to those produced by state of art algorithms while requiring much less time.

#### References

- Abdullah, S., Turabieh, H., McCollum, B., and McMullan, P. (2010). A tabu-based memetic approach for examination timetabling problems. In Yu, J., Greco, S., Lingras, P., Wang, G., and Skowron, A., editors, RSKT, volume 6401 of Lecture Notes in Computer Science, pages 574-581. Springer.
- Amiri, B., Fathian, M., and Maroosi, A. (2009). Application of shuffled frog-leaping algorithm on clustering. The International Journal of Advanced Manufacturing Technology, 45(1-2):199-209.
- Burke, E., Eckersley, A., McCollum, B., Petrovic, S., and Qu, R. (2010). Hybrid variable neighbourhood approaches to university exam timetabling. European Journal of Operational Research, 206(1):46 - 53.
- Burke, E. and Newall, J. (2004). Solving examination timetabling problems through adaption of heuristic orderings. Annals of Operations Research, 129(1- 4):107-134.
- Burke, E. K. and Bykov, Y. (2008). A late acceptance strategy in Hill-Climbing for exam timetabling problems. In PATAT 7808 Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling.
- Carter, M. and Laporte, G. (1996). Recent Developments in Practical Examination Timetabling. In Burke, E.
- Wang, Y.-m., Pan, Q.-k., and Ji, J.-z. (2009). Discrete shuffled frog leaping algorithm for examination timetabling problem. Computer Engineering and Applications, 45(36):40.
- Xu, Y., Wang, L., Liu, M., and Wang, S.-y. (2013). An effective shuffled frog-leaping algorithm for hybrid flow-shop scheduling with multiprocessor tasks. The International Journal of Advanced Manufacturing Technology, pages 1-9.
- Xue-hui, L., Ye, Y., and Xia, L. (2008). Solving tsp with shuffled frog-leaping algorithm. In Intelligent Systems Design and Applications, 2008. ISDA 7808. Eighth International Conference on, volume 3, pages 228-232.
- Yang, Y. and Petrovic, S. (2005). A novel similarity measure for heuristic selection in examination timetabling. In Burke, E. and Trick, M., editors, Practice and Theory of Automated Timetabling V, volume 3616 of Lecture Notes in Computer Science, pages 247-269.
- 50 100 150 200 Number of Generations 250 300

#### Paper Citation

#### in Harvard Style

Leite N., Melício F. and Rosa A. (2013). **Solving the Examination Timetabling Problem with the Shuffled Frog-leaping Algorithm** . In *Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)* ISBN 978-989-8565-77-8, pages 175-180. DOI: 10.5220/0004636001750180

#### in Bibtex Style

@conference{ecta13,

author={Nuno Leite and Fernando Melício and Agostinho Rosa},

title={Solving the Examination Timetabling Problem with the Shuffled Frog-leaping Algorithm},

booktitle={Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)},

year={2013},

pages={175-180},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0004636001750180},

isbn={978-989-8565-77-8},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)

TI - Solving the Examination Timetabling Problem with the Shuffled Frog-leaping Algorithm

SN - 978-989-8565-77-8

AU - Leite N.

AU - Melício F.

AU - Rosa A.

PY - 2013

SP - 175

EP - 180

DO - 10.5220/0004636001750180