Essays about: "University Course Timetabling Problem"
Showing result 1 - 5 of 12 essays containing the words University Course Timetabling Problem.
-
1. Comparing Two-Phase Hybrid Metaheuristics for the University Course Timetabling Problem (UCTP)
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Timetabling is a time consuming and difficult task for large organizations. One popular research field is the university course timetabling problem (UCTP). UCTP is the NP-hard combinatorial problem of scheduling courses at a university while satisfying some constraints. READ MORE
-
2. Applicability of Constraint Solving and Simulated Annealing to Real-World Scale University Course Timetabling Problems
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The university course timetabling problem is the problem of creating a schedule for university courses under certain constraints. The decision variant of this optimisation problem is NP-complete. We have researched this problem and implemented the heuristic simulated annealing. READ MORE
-
3. University Course Scheduling Optimization under Uncertainty based on a Probability Model
University essay from Malmö universitet/Fakulteten för teknik och samhälle (TS)Abstract : In this thesis, we present a way to model uncertainty when optimizing the UniversityTimetabling Problem. It is an NP-hard, combinatorial and highly constrained problem.In this thesis, we first propose a standardized model based on the data from MalmöUniversity. READ MORE
-
4. An Evaluation of the Great Deluge Algorithm in Course Timetabling : As Applied to the KTH-Inspired University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The University Course Timetabling Problem (UCTP) can be loosely described as assigning events (e.g lectures) to rooms and timeslots in a way that results in a feasible timetable that is optimal according to some custom criteria. The problem has become increasingly relevant as more programs become available in universities. READ MORE
-
5. Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The University Course Timetabling Problem (UCTP) is the problem of assigning locations (lecture halls, computer rooms) and time slots (time and date) to a set of events (lectures, labs) while satisfying a number of constraints such as avoiding double-bookings. Many variants of problem formulations exist, and most realistic variants are thought to be NP-hard. READ MORE