Genetic algorithm with forced diversity for the university timetabling problem

Authors:
Juan Frausto-Solis;Jaime Mora-Vargas;Monica Larre;Jose Luis Gomez-Ramos
Affiliations:
Computer Science Department, ITESM, Cuernavaca, México;Computer Science Department, ITESM, Estado de México, México;Computer Science Department, ITESM, Cuernavaca, México;Computer Science Department, Universidad Juárez Autonoma de Tabasco, México
Venue:
ICS'06 Proceedings of the 10th WSEAS international conference on Systems
Year:
2006

Citing 4
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
A comparison of the performance of different metaheuristics on the timetabling problem

A comparison of the performance of different metaheuristics on the timetabling problem

Quantified Score

Hi-index	0.01

Visualization

Abstract

The University Timetabling problem (UTT) is about finding an optimal distribution of classrooms and faculty during a fixed period of time. UTT is a common problem for Educational Institutions. Genetic algorithms (GAs) are used to obtain high quality results for UTT. GAs are a general purpose metaheuristics that generate very good results when population diversity is correctly handled. This paper presents a new GA for UTT that incorporates a set of rules to guarantee the population diversity.