International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 42 - Issue 15 |
Published: March 2012 |
Authors: Sanjay R. Sutar, Rajan S. Bichkar |
![]() |
Sanjay R. Sutar, Rajan S. Bichkar . University Timetabling based on Hard Constraints using Genetic Algorithm. International Journal of Computer Applications. 42, 15 (March 2012), 1-7. DOI=10.5120/5766-7964
@article{ 10.5120/5766-7964, author = { Sanjay R. Sutar,Rajan S. Bichkar }, title = { University Timetabling based on Hard Constraints using Genetic Algorithm }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 42 }, number = { 15 }, pages = { 1-7 }, doi = { 10.5120/5766-7964 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A Sanjay R. Sutar %A Rajan S. Bichkar %T University Timetabling based on Hard Constraints using Genetic Algorithm%T %J International Journal of Computer Applications %V 42 %N 15 %P 1-7 %R 10.5120/5766-7964 %I Foundation of Computer Science (FCS), NY, USA
The proposed system presents a novel approach of solving University timetabling which is NP-hard problem using Genetic Algorithm. Genetic Algorithm is frequently deployed Meta heuristics algorithm which can be effectively used to difficult combinatorial optimization problems. Although, there has been an extensive research towards this field but majority of the research results are much in its nascent stage. The previous researchers have used various methods like Tabu search, Simulated Annealing, network flow, graph coloring, etc. Genetic Algorithms are effective in solving many such optimization problems. The current work presented uses Genetic Algorithm to design an effective model for scheduling with challenging constraints considerations. The objective of the research is to create a model using Genetic Algorithm to the extent it can be used to generate the acceptable schedule using probabilistic operators like mutation and crossover. The design of the fitness function has considered the hard constraints. The simulation shows the better result in minimum time.