A comparative analysis of a Tabu Search and a Genetic Algorithm for solving a University Course Timetabling Problem
This work implements a Tabu search (TS) algorithm for solving an instance of the University Course Timetabling Problem (UCTP). The algorithm is com- pared to a Genetic algorithm (GA) implemented by Yamazaki and Pertoft (2014) that solves the same instance. The purpose of the work is to explore how t...
Main Authors: | Renman, Casper, Fristedt, Hampus |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Skolan för datavetenskap och kommunikation (CSC)
2015
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166276 |
Similar Items
-
A Comparative Study between Genetic Algorithm, Simulated Annealing and a Hybrid Algorithm for solving a University Course Timetabling Problem
by: Salman, Alzahraa, et al.
Published: (2018) -
Comparing MAX-MIN and Rank-based Ant Colony Optimization Algorithms for solving the University Course Timetabling Problem
by: Broberg, Felix, et al.
Published: (2018) -
Local search hybridization of a genetic algorithm for solving the University Course Timetabling Problem
by: Forsberg, Mikael
Published: (2018) -
Efficiency of the hybrid AC3-tabu search algorithm for solving Sudoku puzzles
by: Lindberg, Joakim, et al.
Published: (2015) -
Investigating a Genetic Algorithm-Simulated Annealing Hybrid Applied to University Course Timetabling Problem : A Comparative Study Between Simulated Annealing Initialized with Genetic Algorithm, Genetic Algorithm and Simulated Annealing
by: Norgren, Eric, et al.
Published: (2016)