Learn More
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for representing timetabling problem instances. In this paper, a framework for designing memetic algorithms (MAs) to solve timetabling problems is described and a tool, named Final Exam(More)
guidance and encouragement during this project. I would like to thank my family for their support and love begins from my birth. Life has no meaning without them. I am also truly grateful to Elif Gürbüz, for her infinite patience, tolerance, support and friendship. ABSTRACT Timetabling problems are hard problems that can not be solved in polynomial time. As(More)
  • 1