Академический Документы
Профессиональный Документы
Культура Документы
Abstract
Timetable problem is well known problem and is
extensively studied in the literature. There are many variations of the problem based on the required hard and soft constraints to be satisfied. Genetic Algorithmic approach has also been considered for solving this problem. Different configurations of courses, professors, rooms and groups of students are tested using simulation in C++ based on Genetic Algorithmic approach and results convey whether the schedule achieved is feasible or not.
Objectives
Understanding the problem and identifying the constraints
using C++.
A configuration file is to be added where a user needs to
fill various courses, teachers, class rooms and different groups of students who wish to attend a particular course.
Methodology
Objects of Class Schedule Professor The Professor class has an ID and the name of the professor. It also contains a list of classes that a professor teaches. Students Group The StudentsGroup class has an ID and the name of the student group, as well as the number of students (size of group). It also contains a list of classes that the group attends.
Objects (cont.)
Classroom
The Room class has an ID and the name of the classroom, as well as the number of seats and information about equipment (computers). Course The Course class has an ID and the name of the course. Class CourseClass holds a reference to the course to which the class belongs, a reference to the professor who teaches, and a list of student groups that attend the class
Simulation Results
Observations
These timetables are generated taking in view the room
no. and which classes and at what time will be taking place in those room numbers. The university can try to reduce the quantity of rooms and can check whether the viable solution is possible or not.
An example taking in view the higher load that is more
courses and students that can be handled by a single room is simulated which shows the courses which cannot be scheduled. So accordingly the authorities can set number of rooms which can satisfy all the hard and soft constraints towards this problem.
Failed Time-table
Conclusions
The time table scheduling problem was well understood
and analyzed.
Based on underlying Genetic Algorithm a successful