Abstract
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. This paper shows the implementation of a Bee Algorithm (BA) to solve the Scholar Timetabling Problem. In the implemented BA, scout bees find feasible solutions while collector bees search in their neighborhood to find better solutions. While other algorithms evaluate every plausible assignment, the implemented algorithm only evaluates feasible solutions. This approach seems to be helpful to manage constrained problems. We propose a new measurement for replacing population that considers the evolutionary history of the bees as well as their fitness. Experimental results are presented for two real schools, where the algorithm shows promising results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdullah, S., Burke, E., McCollum, B. (eds.): Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem. Computer Science Interfaces Book series. Springer Operations Research (2006)
Abdullah, S., Burke, E.K., McCollum, B.: A hybrid evolutionary approach to the university course timetabling problem. In: CEC (2007)
de Werra, D.: An introduction to timetabling. European Journal of Operational Research 19(2), 151–162 (1985)
Di Gaspero, L., Schaerf, A.: Multi-neighbourhood local search with application to course timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 263–278. Springer, Heidelberg (2003)
Neufeld, G.A., Tartar, J.: Graph coloring conditions for the existence of solutions to the timetable problem. Commun. ACM 17(8), 450–453 (1974)
Pham, D., Ghanbarzadeh, A., Koç, E., Otri, S., Rahim, S., Zaidi, M.: The bees algorithm a novel tool for complex optimisation problems. In: IPROMS 2006 (2006)
Rossi-Doria, O., Paechter, B.: A memetic algorithm for university course timetabling. In: Combinatorial Optimisation 2004 Book of Abstracts, Lancaster, UK, Lancaster University (2004)
Schaerf, A.: A survey of automated timetabling. In: Centrum voor Wiskunde en Informatica (CWI), vol. 115, page 33 (1995), ISSN 0169-118X
Schaerf, A.: Tabu search techniques for large high-school timetabling problems. In: Centrum voor Wiskunde en Informatica (CWI), vol. 88, page 17 (1996), ISSN 0169-118X
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lara, C., Flores, J.J., Calderón, F. (2008). Solving a School Timetabling Problem Using a Bee Algorithm. In: Gelbukh, A., Morales, E.F. (eds) MICAI 2008: Advances in Artificial Intelligence. MICAI 2008. Lecture Notes in Computer Science(), vol 5317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88636-5_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-88636-5_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88635-8
Online ISBN: 978-3-540-88636-5
eBook Packages: Computer ScienceComputer Science (R0)