Abstract
The Course Timetabling problem is one of the most difficult and common problems inside an university. The main objective of this problem is to obtain a timetabling with the minimum student conflicts between assigned activities. A Methodology of design is a strategy applied before the execution of an algorithm for timetabling problem. This strategy has recently emerged, and aims to improve the obtained results as well as provide a context-independent layer to different versions of the timetabling problem. This methodology offers to an interested researcher the advantage of solving different set instances with a single algorithm which is a new paradigm in the timetabling problem state of art. In this paper the proposed methodology is tested with several metaheuristic algorithms over some well-know set instances such as Patat 2002 and 2007. The main objective in this work is to find which metaheuristic algorithm shows a better performance in terms of quality, used together with the Design Methodology. The algorithms chosen are from the area of evolutionary computation, Cellular algorithms and Swarm Intelligence. Finally our experiments use some non-parametric statistical test like Kruskal-Wallis test and wilcoxon signed rank test.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alba, E., Dorronsoro, B.: Introduction to Cellular Genetic Algorithms. Cellular Genetic Algorithms, 3–20 (2008)
Alba, E., Dorronsoro, B.: The State of the Art in Cellular Evolitionary Algorithms. Cellular Genetic Algorithms 1, 21–34 (2008)
Burke, E., Bykov, Y., Newall, J., Petrovic, S.: A time-predefined local search approach to exam timetabling problems. Computer Science TEchnical Report No. NOTTCS-TR-2001-6, 1 (2001)
Cambazard, H., Hebrard, E., O’Sullivan, B., Papadopoulos, A.: Submission to ICT: Track 2. In: International Timetabling Compertition 2007 (2008)
Colorni, A., Dorigo, M., Maniezzo, V.: Genetic algorithms and highly constrained problems: The time-table case. In: Schwefel, H.-P., Männer, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 55–59. Springer, Heidelberg (1991)
Cooper Tim, B., Kingston, J.K.: The Compexity of Timetable Construction Problems. PhD thesis, The University of Sydney (1995)
Dueck, G.: New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel. Journal of Computational Physics 104, 86–92 (1993)
Erben, W.: A Grouping Genetic Algorithm for Graph Colouring and Exam Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 132–158. Springer, Heidelberg (2001)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proccedings of IEEE International Conference on Neural Networks, vol. 1, pp. 1942–1948 (1995)
Kostuch. P. Timetabling Competition-SA-based Heuristic. Metaheuristics Network (2003)
Rhydian, L.: Metaheuristics for University Course Timetabling. PhD thesis. University of Notthingham (August 2006)
Angel, K.M.: A solution to the prisioner’s dilemma using an eclectic genetic algorithm. In: IPN, vol. 1 (2000)
Angel, K.M., Quezada, C.V.: A universal Eclectic Genetic Algorithm for constrained optimization. ITAM, 1 (1998)
Price, K., Storn, R., Lampinen: Differential Evolution: A pratical approach to global optimization. Springer (2005)
Andrea, S., Di Gaspero, L.: Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867, pp. 40–49. Springer, Heidelberg (2007)
Soria-Alcaraz Jorge, A.: Diseño de horarios con respecto al alumno mediante técnicas de cómputo evolutivo. Master’s thesis, Instituto Tecnologico de León (2010)
Soria-Alcaraz Jorge, A., Carpio, M., Puga, H.: Diseño de Horarios mediante algoritmos géneticos. Décima Primera Reunión de Otoño de Potencia. In: Electrónica y Computación del IEEE, XI ROPEC, Morelia, vol. 1, pp. 24–35 (2009)
Soria-Alcaraz Jorge, A., Terashima-Marin, H., Carpio, M.: Academic Timetabling Design using Hyper-heuristics. In: Advances in Soft Computing, ITT, vol. 1, pp. 158–164. Springer (2010)
Storn, R.: On the usage of differential evolution for function optimization. In: Biennial Conference of the North America Fuzzy Information Processing Society (NAFIPS), pp. 519–523 (1996)
Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for gobal optimization over continuous spaces. Journal of Global Optimization 11, 341–359 (1997)
Willemen Robertus, J.: School Timetable Constructrion: Algorithms and complexity. PhD thesis. Institutefor Programming research and Algorithms (2002)
Wolpert, H., Macready, G.: No free lunch Theorems for Search. Technical report The Santa Fe Institute, 1 (1996)
Yang, Y., Petrovic, S.: A Novel Similarity Measure for Heuristic Selection in Examination Timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol. 3616, pp. 247–269. Springer, Heidelberg (2005)
Yang, X.-S.: Nature-Inspired Metaheuristics Algorithms, 2nd edn. Luniver Press (2010)
Yu, E., Sung, K.S.: A Genetic Algorithm for a University Wekly Courses Timetabling Problem. International Transactions in Operational Research 9, 703–717 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soria-Alcaraz Jorge, A., Martín, C., Héctor, P., Sotelo-Figueroa, M.A. (2013). Comparison of Metaheuristic Algorithms with a Methodology of Design for the Evaluation of Hard Constraints over the Course Timetabling Problem. In: Castillo, O., Melin, P., Kacprzyk, J. (eds) Recent Advances on Hybrid Intelligent Systems. Studies in Computational Intelligence, vol 451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33021-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-33021-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33020-9
Online ISBN: 978-3-642-33021-6
eBook Packages: EngineeringEngineering (R0)