A classroom must have enough seats to accommodate all students.No professor or student group can have more then one class at a time.A class can be placed only in a spare classroom.Hard requirements (if you break one of these, then the schedule is infeasible): These requirements can be divided into several groups by their importance. When you make a class schedule, you must take into consideration many requirements (number of professors, students, classes and classrooms, size of classroom, laboratory equipment in classroom, and many others). In this article, I assume that you are familiar with the basic concepts of genetic algorithms, and I won't describe them in detail because it has been done so many times before. This is where genetic algorithms come in to the game. For more complex inputs and requirements, finding a considerably good solution can take a while, or it may be impossible. ![]() The problem can be solved using a heuristic search algorithm to find the optimal solution, but it only works for simple cases. ![]() Making a class schedule is one of those NP hard problems.
0 Comments
Leave a Reply. |