Timetabling by meta-heuristic methods

摘要

Most of the recent approaches to practical timetabling are by integer programming, graph coloring, meta-heuristic such as genetic algorithm and tabu search, and constraint logic such as back trackng This paper discusses the difficulties of the meta-heuristics approach, and shows examples of the approaches of this category