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

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

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 e...

Full description

Bibliographic Details
Main Author: Forsberg, Mikael
Format: Others
Language:English
Published: KTH, Skolan för elektroteknik och datavetenskap (EECS) 2018
Subjects:
Timetabling
University Course Timetabling Problem
Metaheuristics
Hybridization
Genetic Algorithm
Tabu Search
Schemaläggning
Metaheuristik
Hybridisering
Genetisk Algoritm
Tabusökning
Computer Sciences
Datavetenskap (datalogi)
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229677

Internet

http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229677

Similar Items