A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university

Authors:
Ricardo Santiago-Mozos;Sancho Salcedo-Sanz;Mario DePrado-Cumplido;Carlos Bousoño-Calzón
Affiliations:
Department of Signal Theory and Communications, Universidad Carlos III de Madrid, Leganes, Madrid 28911, Spain;Department of Signal Theory and Communications, Universidad Carlos III de Madrid, Leganes, Madrid 28911, Spain;Department of Signal Theory and Communications, Universidad Carlos III de Madrid, Leganes, Madrid 28911, Spain;Department of Signal Theory and Communications, Universidad Carlos III de Madrid, Leganes, Madrid 28911, Spain
Venue:
Computers and Operations Research
Year:
2005

Citing 15
Cited 6

A survey of practical applications of examination timetabling algorithms

Operations Research
Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Metaheuristics for High School Timetabling

Computational Optimization and Applications
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Evolutionary Algorithms in Engineering Applications

Evolutionary Algorithms in Engineering Applications
A Survey of Automated Timetabling

Artificial Intelligence Review
Hopfield neural networks for timetabling: formulations, methods, and comparative results

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems

Proceedings of the 6th International Conference on Genetic Algorithms
Timetabling the Classes of an Entire University with an Evolutionary Algorithm

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Computer-Aided School and University Timetabling: The New Wave

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Building University Timetables Using Constraint Logic Programming

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Recent Developments in Practical Course Timetabling

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Genetic algorithms and timetabling

Advances in evolutionary computing

Applying evolutionary computation to the school timetabling problem: The Greek case

Computers and Operations Research
A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups

Expert Systems with Applications: An International Journal
Resource assignment and scheduling based on a two-phase metaheuristic for cropping system

Computers and Electronics in Agriculture
Leveraging saving-based algorithms by master-slave genetic algorithms

Engineering Applications of Artificial Intelligence
Interactively solving school timetabling problems using extensions of constraint programming

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Survey: A survey of repair methods used as constraint handling techniques in evolutionary algorithms

Computer Science Review

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents, as a case study, the application of a two-phase heuristic evolutionary algorithm to obtain personalized timetables in a Spanish university. The algorithm consists of a two-phase heuristic, which, starting from an initial ordering of the students, allocates students into groups, taking into account the student's preferences as a primal factor for the assignment. An evolutionary algorithm is then used in order to select the ordering of students which provides the best assignment.The algorithm has been tested in a real problem, the timetable of the Telecommunication Engineering School at Universidade de Vigo (Spain), and has shown good performance in terms of the number of constraints fulfilled and groups assigned to students.