Sökning: "University timetabling problem"

Visar resultat 1 - 5 av 17 uppsatser innehållade orden University timetabling problem.

  1. 1. Comparing Two-Phase Hybrid Metaheuristics for the University Course Timetabling Problem (UCTP)

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Isabella Andersson; Carl Petter Svensson; [2019]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER

  3. 2. Applicability of Constraint Solving and Simulated Annealing to Real-World Scale University Course Timetabling Problems

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Felix Almay; Oskar Strömberg; [2019]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER

  4. 3. University Course Scheduling Optimization under Uncertainty based on a Probability Model

    Kandidat-uppsats, Malmö universitet/Fakulteten för teknik och samhälle (TS)

    Författare :David Sandh; Lucas Knutsäter; [2019]
    Nyckelord :University Timetabling; Timetabling; Optimization; Uncertainty; Evolutionary algorithms;

    Sammanfattning : 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. LÄS MER

  5. 4. An Evaluation of the Great Deluge Algorithm in Course Timetabling : As Applied to the KTH-Inspired University Course Timetabling Problem

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Kristoffer Chammas; Simon Sirak; [2019]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER

  7. 5. Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Mikael Forsberg; [2018]
    Nyckelord :Timetabling; University Course Timetabling Problem; Metaheuristics; Hybridization; Genetic Algorithm; Tabu Search; Schemaläggning; University Course Timetabling Problem; Metaheuristik; Hybridisering; Genetisk Algoritm; Tabusökning;

    Sammanfattning : 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. LÄS MER