Işık Üniversitesi final sınav programı için genetik algoritma uygulaması

Text in English ; Abstract: English and Turkish Includes bibliographical references (leaves 32-34) x, 64 leaves Exam timetabling is a widely encountered scheduling problem at educational institutions. Typically, exam timetabling problems involve some hard constraints and several soft constraints that may vary from one institution to another. One of the soft constraints is that as few students as possible should have more than a predefined number of exams on the same day. At Isik University, if students have more than two exams on the same day they are allowed to ask for makeup exams for the extra exams. While integer programming formulations with other constraints of Isik University could be solved to optimality via commercial solvers, incorporating the daily exam limitation rule proved to be intractable. Hence a genetic algorithm was developed. Using data from several semesters, numerical experiments were conducted to tune the developed genetic algorithm's parameters and test it. The new metaheuristic algorithm was also coded in Java programming language and integrated into finexa, the internally developed exam timetabling software at Isik University. Üniversitelerde sık ça kar şılaşı lan çizelgeleme problemlerden biri sı nav haftası programın ın ayarlanmas ıd ır. S ınav saatleri ayarlan ırken zorunlu ve zorunlu olmayan k ısı tlar g öz ön ünde bulundurulur. Zorunlu olmayan k ıs ıtlardan biri, aynı g ünde istenilenden daha fazla sınava girecek olan ö ğrenci say ısı nı n olabildi ğince az olması kı s ıt ıd ır. I şı k Üniversitesinde bir g ünde ikiden fazla finali olan öğrenciler mazeret s ınavı na girebilme hakkı na sahiptir. I şık Üniversitesinde final program ı ayarlanı rken dikkat edilen di ğer kurallar i çin tamsayı lı programlama ile çöz üm üretilebilirken bahsedilen k ıs ıt problemi bu y öntemle çöz ülemez hale getirdi. Bu nedenle yakla şık bir y öntem ile çöz üm üretme zorunlulu ğu do ğdu. Geli ştirilen genetik algoritmayı test ederken d ört d önemin verisinden faydaland ık. Ayr ıca yeni y öntem Java dilinde kodlanarak I şık Üniversitesinde kullanı lan s ınav çizelgeleme programı nexa aray üz üne entegre edildi. Introduction Motivation Related Work Outline of Thesis Integer Programming Formulations Final Exam Scheduling at Işık University Core Model Index sets Parameters Decision variables Formulation Model With No 3 Exam Rule Index sets Parameters Decision variables Formulation Genetic Algorithm (GA) and Exam Scheduling GA Initialization Evaluation Selection Recombination Mutation Replacement GA for Exam Scheduling Construction Heuristic Improvement Algorithm Solution Representation Crossover and Mutation Operators Experiments Problem Instances Preliminary Experiments Memetic Algorithm Conclusion