Automated Timetable Generator |
Author(s): |
| Shweta R. Gajbhiye , Priyadarshini J.L. College of Engineering; Diksha M. Gondane, Priyadarshini J.L. College of Engineering; Nisha I. Shende, Priyadarshini J.L. College of Engineering |
Keywords: |
| Graph Colouring Algorithm, Timetable, Hard Constraints, Soft Constraints, Conflicts-Free, Optimal |
Abstract |
|
Timetable creation is a very tedious and time consuming task; it takes lots of patience and man hours. Graph colouring technology helps to resolve this problem and introduces a practical timetabling algorithm capable of taking care of both hard and soft constraints effectively, used in an automated timetabling system for educational institutions. To resolve the complexity and to reduce the efforts of generating timetable manually, there are some other technologies like backtracking algorithm, Ant Colony Optimization, Bee Colony Optimization; Genetic Algorithm etc. are also available. Though these technologies provide the solution for timetable generation, these are slower and sometimes to provide the optimal solution there is a risk of losing the data when applied on large spaces. Graph colouring provides the exact solution for generating a conflicts-free timetable that too in optimal time. |
Other Details |
|
Paper ID: IJSRDV5I90013 Published in: Volume : 5, Issue : 9 Publication Date: 01/12/2017 Page(s): 10-12 |
Article Preview |
|
|
|
|
