Skip to content

Latest commit

 

History

History
5 lines (5 loc) · 363 Bytes

File metadata and controls

5 lines (5 loc) · 363 Bytes

Degree Project in Computer Science, KTH

Comparison Between Simulated Annealing and Generic Algorithm for the University Timetabling Problem

A repository containing the implementation of two heuristic algorithms solving the University Timetabling Problem, as a part of a Degree Project at KTH. The two algorithms are

  • Simulated annealing
  • Genetic algorithm