Keywords
university timetables
genetic algorithms
fitness
programación
horarios universitarios
algoritmos genéticos
función objetivo
How to Cite
Abstract
The main purpose of this research is to design a methodology based on evolutionary algorithms to university timetable scheduling. This methodology will consider the students’ cognitive rhythms, which establish that teaching certain subjects in specific time intervals is much better than other techniques. This project takes place in three phases. First of all, there is a description of the different techniques used to solve this problem. Then, a new methodology based on cognitive rhythms and evolutionary algorithms is proposed, and finally, different methodologies are compared to determine the best. It is concluded that evolutionary algorithms are more efficient than other techniques in the university timetable scheduling. Future lines of research will determine the impact of these techniques within the students’ learning process.References
Abdullah, S.; Alzaqebah, M. (2013) “A hybrid self-adaptive bees algorithm for examination timetabling problems”, Applied Soft Computing 13(8): 3608–3620.
Burke, E.K.; Petrovic, S. (2002) “Recent research directions in automated timetabling”, European Journal of Operational Research 140(2): 266–280.
Burke, E.K.; Mareček, J.; Parkes, A.J.; Rudová H. (2010) “Decomposition, reformulation, and diving in university course timetabling”, Computers & Operations Research 37(3): 582–597.
Burke, E.K.; Kendall, G.; Mısır, M.; Özcan, E. (2012) “MonteCarlo hyper-heuristics for examination timetabling”, Annals of Operations Research 196(1): 73–90.
Cacchiani, V.; Caprara, A.; Roberti, R.; Toth, P. (2013) “A new lower bound for curriculum-based course timetabling”, Computers & Operations Research 40(10): 2466–2477.
Castiñeiras, I.; Sáenz-Pérez, F. (2013) “Applying CP(F D), CLP(FD) and CFLP(F D) to a Real-life Employee Timetabling Problem”, Procedia Computer Science 18: 531–540.
Castrillón, O.D. (2013) “Planning University Schedules Using Evolutionary Algorithms and Cognitive Rhythms”, EIIC-2013 2nd Electronic International Interdisciplinary Conference 2013, Budapest virtual conference: 448–450.
Castrillón, O.D. (2014) “Combinación entre un Algoritmo Genético y Aleatorio para Programación de Horarios Universitarios Basado en Ritmos Cognitivos”, Información Tecnológica 25(4): 51–62.
Daskalaki, S.; Birbas, T.; Housos, E. (2004) “An integer programming formulation for a case study in university timetabling”, European Journal of Operational Research 153(1): 117–135.
De Causmaecker, P.; Demeester, P.; Vanden Berghe, G. (2009) “A decomposed metaheuristic approach for a real-world university timetabling problem”, European Journal of Operational Research 195(1): 307–318.
Dimopoulou, M.; Miliotis, P. (2001) “Implementation of a university course and examination timetabling system”, European Journal of Operational Research 130(1): 202–213.
Dimopoulou, M.; Miliotis, P. (2004) “An automated university course timetabling system developed in a distributed environment: A case study”, European Journal of Operational Research 153(1): 136–147.
Fahrion, R.; Dollansky, G. (1992) “Construction of university faculty timetables using logic programming techniques”, Discrete Applied Mathematics 35(3): 221–236.
Ferland, J.A.; Lavoie, A. (1992) “Exchanges procedures for timetabling problems”, Discrete Applied Mathematics 35(3): 237–253.
Foulds, L.R.; Johnson, D.G. (2000) “SlotManager: a microcomputer- based decision support system for university timetabling”, Decision Support Systems 27(4): 367–381.
Goerigk, M.; Obel, A. (2013) “Improving the modulo simplex algorithm for large-scale periodic timetabling”, Computers & Operations Research 40(5): 1363–1370.
Head, C.; Shaban, S. (2007) “A heuristic approach to simultaneous course/student timetabling”, Computers & Operations Research 34(4): 919–933.
Hernández, R.; Miranda, J.; Rey, P.A. (2008) “Programación de Horarios de Clases y Asignación de Salas para la Facultad de Ingeniería de la Universidad Diego Portales Mediante un Enfoque de programación Entera”, Revista Ingeniería de Sistemas 22: 121–141.
Hertz, A. (1992). “Finding a feasible course schedule using Tabu search”, Discrete Applied Mathematics 35(3): 255–270.
Kahar, M.; Kendall, G. (2010) “The examination timetabling problem at University Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution”, European Journal of Operational Research 207(2): 557–565.
Lü, Z.; Hao, J.-K. (2010) “Adaptive Tabu Search for course timetabling”, European Journal of Operational Research 200(1) 235–244.
Martínez, H.; Camargo, C.; Reyes, M. (2004) Ritmos Cognitivos en la Escuela. Universidad Pedagógica Nacional, Bogotá.
McCollum, B.; McMullan, P.; Burke, E.K.; Parkes, A.J.; Qu, R. (2008) “A New Model for Automated Examination Timetabling”, School of Computer Science, University of Nottingham: 1–24.
Mejía, J.; Paternina, C. (2010) “Asignación de horarios de clases Universitarias Mediante Algoritmos Evolutivos”, Educación e Ingeniería 5(9): 140–149.
Mej́ıa, J.C. (2008) Asignación de Horarios de Clases Universitarias Mediante Algoritmos Evolutivos. Universidad del Norte, Barranquilla.
MirHassani, S.A. (2006) “A computational approach to enhancing course timetabling with integer programming”. Applied Mathematics and Computation 175(1): 814–822.
Özcan, E.; Parkes, A.J.; Alkan, A. (2012) “The Interleaved Constructive Memetic Algorithm and its application to timetabling”, Computers & Operations Research 39(10): 2310–2322.
Pillay, N.; Banzhaf, W. (2009) “A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem”, European Journal of Operational Research 197(2): 482–491.
Pillay, N.; Banzhaf, W. (2010)“An informed genetic algorithm for the examination timetabling problem”, Applied Soft Computing 10(2): 457–467.
Rahman, S.; Bargiela, A.; Burke, E.; Özcan. E.; McCollum, B.; Mc- Mullan, P. (2014) “Adaptive linear combination of heuristic orderings in constructing examination timetables”, European Journal of Operational Research 232(2): 287–297.
Soza, C.; Landa, R.; Riff, M.C.; Coello, C.A. (2011) “Solving timetabling problems using a cultural algorithm”, Applied Soft Computing 11(1): 337–344.
Suárez, V.; Castrillón, O. (2011) “Diseño de una metodología basada en técnicas inteligentes para la distribución de procesos académicos en ambientes de trabajo Job Shop”, XV Congreso de Ingeniería de la Organización, Universidad Politécnica de Cartagena, España: 285–289.
Suarez, V. (2012) Asignación de horarios de clase en instituciones de educación básica y media de acuerdo a ritmos de eficiencia cognitiva. Tesis de Maestría, Universidad Nacional de Colombia.
Suarez, V.; Castrillón, O.; Guerrero, A. (2013) “Asignación de horarios de clase basado en los ritmos de aprendizaje de los estudiantes usando un algoritmo genético”, Ingeniería y Ciencia 9(17): 77–95.
Suarez, V.; Guerrero. A.; Castrillón, O. (2013) “Programación de Horarios Escolares basados en Ritmos Cognitivos usando un Algoritmo Genético de Clasificación No-dominada, NSGA-II”, Información Tecnológica 24(1): 103–113.
Tassopoulos, I.X.; Beligiannis, G.N. (2012a)“A hybrid particle swarm optimization based algorithm for high school timetabling problems”, Applied Soft Computing 12(11), 3472–3489.
Tassopoulos, I.X.; Beligiannis, G.N. (2012b). “Solving effectively the school timetabling problem using particle swarm optimization”, Expert Systems with Applications 39(5): 6029–6040.
Valentinuzzi, V.; Fontenele, J. (2008) “Los ritmos biológicos y el aprendizaje”, Ingenierías XI(40): 41–46.
Valouxis, C.; Housos, E. (2003) “Constraint programming approach for school timetabling”, Computers & Operations Research 30(10): 1555–1572.
Van den Broek, J.; Hurkens, C.; Woeginger, G. (2006) “Timetabling problems at the TU Eindhoven”, Electronic Notes in Discrete Mathematics 25: 27–28.