Solving Timetabling Problems by Hybridizing Genetic Algorithms and Taboo Search
Résumé
As demand for Education increases and diversifies, so does the difficulty of designing workable timetables for schools and academic institutions. Besides the intractability of the basic problem, there is an increasing variety of constraints that come into play. In this paper we present a hybrid of two metaheuristics (genetic algorithm and tabu search) to tackle the problem in its most general setting. Promising experimental results are shown.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...