Journal ArticleDOI
Solution approaches to the course timetabling problem
S. A. Mirhassani,F. Habibi +1 more
Reads0
Chats0
TLDR
This work focuses on university timetabling and introduces hard and soft constraints as well as most currently used objective functions in university course timetabling.Abstract:
University course timetabling is one of the most important administrative activities that take place in all academic institutions. In this work, we go over the main points of recent papers on the timetabling problem. We concentrate on university timetabling and introduce hard and soft constraints as well as most currently used objective functions. We also discuss some solution methods that have been applied by researchers. Finally, we raise more questions to be explored in future studies. We hope the directions lead to new researches that cover all aspects of the problem and result in high-quality timetables.read more
Citations
More filters
Journal ArticleDOI
Solving the post enrolment course timetabling problem by ant colony optimization
TL;DR: A new approach to tackle the problem of Post Enrolment Course Timetabling as specified for the ITC2007, based on Ant Colony Optimization, which uses the use of two distinct but simplified pheromone matrices to improve convergence.
Journal ArticleDOI
An overview of curriculum-based course timetabling
TL;DR: This survey is devoted to review the main works on the topic, with focus on mathematical models, lower bounds, and exact and heuristic algorithms that could make the study of CB-CTT even more challenging and closer to reality.
Journal ArticleDOI
Integer programming methods for large-scale practical classroom assignment problems
TL;DR: A novel formulation of the problem is introduced which generalises existing models and maintains tractability even for large instances and expands upon existing results into the computational difficulty of room assignment problems.
Journal ArticleDOI
Developing Compact Course Timetables with Optimized Student Flows
TL;DR: A two-stage integer programming approach for building a university course timetable that aims at minimizing the resulting student flows and consistently succeeds in finding good quality feasible solutions.
Journal ArticleDOI
University course timetabling model using ant colony optimization algorithm approach
TL;DR: In this study, ant colony optimization (ACO) algorithm approach has been developed for university course timetabling problem and ACO is believed to be a powerful solution approach for various combinatorial optimization problems.
References
More filters
Book
Handbook of Graph Theory
Jonathan L. Gross,Jay Yellen +1 more
TL;DR: Introduction to Graphs Fundamentals of Graph Theory, Jonathan L. Gross and Jay Yellen Families of Graphs and Digraphs, Lowell W. Wilson Graph Representation Computer Representation of graphs, Alfred V. Aho Graph Isomorphism, Brendan D. McKay The Reconstruction Problem, Josef Lauri Recursively Constructed Graphs, Richard B. Tovey Structural Graph Theory.
Journal ArticleDOI
An introduction to timetabling
TL;DR: A huge variety of timetabling models have been described in the OR literature; they range from the weekly timetable of a school to the scheduling of courses or exams in a university.
Journal ArticleDOI
A Survey of Automated Timetabling
TL;DR: A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or school) and the types of constraints as mentioned in this paper.
Journal ArticleDOI
A Tabu-Search Hyperheuristic for Timetabling and Rostering
TL;DR: It is demonstrated that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances and is fundamentally more general than state-of-the-art problem-specific techniques.
Journal ArticleDOI
A Graph-Based Hyper-Heuristic for Educational Timetabling Problems
TL;DR: In this article, a generic hyper-heuristic approach based on a set of widely used graph coloring heuristics is proposed for timetabling problems, where a Tabu Search approach is employed to search for permutations of graph heuristic which are used for constructing timetables.