TimeTabling-GeneticAlgorithm

Genetic Algorithms are the method for finding enough good solutions for the problems which cannot be solved by a standard method named NP-Hard problems. Although it does not guaranty the best solution, we can find relatively enough good solutions for most engineering problems within that method [1].

Educational institutes such as high schools universities use weekly course timetabling to use all sources in an optimum way. To make an optimum weekly timetable is such an example of NP-Hard problem which cannot be solved in any brutal force method which checks every single probability.

In this repository, we provided a solution to that problem using Genetic Algorithm which tries to minimize determined fitness function which that function is a sort of measurement of how the timetable is optimum [2].