My question is about genetic algorithm, and its use at creating exam schedule.
Task is to form simple exam schedule, where we have list od exams, halls and professors such that there is no overllaping between professors and halls.
My idea:First I thought creating list of schedules, such that every schedule is list od 3-length arrays. Those arrays would contain one professor, exam and hall. That would be initial population. (For professors, halls and exams I used random numbers from some range).
Next step is to calculate fitness for every schedule(chromosome) inside population. I need some help about that. Since it is written that there should not be overllaping for halls and professors, I thought to calculate number of conflicts for each professor inside 3-length array od that individual(number of same halls for that professor). But, that would give number of conflicts for each professor, not that schedule. So, not sure how to find fitness of one schedule(individual). Every help is appreciated.