Master Degree / Yüksek Lisans Tezleri
Permanent URI for this collectionhttps://hdl.handle.net/11147/3008
Browse
2 results
Search Results
Master Thesis Solving the Course Scheduling Problem by Constraint Programming and Simulated Annealing(Izmir Institute of Technology, 2008) Aycan, Esra; Ayav, TolgaIn this study it has been tackled the NP-complete problem of academic class scheduling (or timetabling). The aim of this thesis is finding a feasible solution for Computer Engineering Department of İzmir Institute of Technology. Hence, a solution method for course timetabling is presented in this thesis, consisting of two phases: a constraint programming phase to provide an initial solution and a simulated annealing phase with different neighbourhood searching algorithms. When the experimental data are obtained it is noticed that according to problem structure, whether the problem is tightened or loosen constrained, the performance of a hybrid approach can change. These different behaviours of the approach are demonstrated by two different timetabling problem instances. In addition to all these, the neighbourhood searching algorithms used in the simulated annealing technique are tested in different combinations and their performances are presented.Master Thesis Scheduling the Turkish Soccer League Using Mathematical Programming(Izmir Institute of Technology, 2013) Güney, Faruk; Aslan, Burak GalipGenerating a fair and feasible schedule is a difficult challenge for sports league organizers because of having various requirements from various involved parties. Some of these requirements are fairness requirements. Turkish Soccer League should be scheduled by according to these requirements especially because of the reduction of the confidence in Turkish Soccer League organizers and authorities due to the case of match fixing in recent years. As scheduling Turkish Soccer League, the prior requirements in our study are the minimization of the total number of break, carry over effect (COE) value of a schedule in addition to meeting the conflicting venue constraints. We decomposed scheduling process in phases to facilitate our solution. We used a different variation of first-break-then-schedule approach, proposed by Rasmussen and Trick (2008), to meet break conditions initially and solved each phase by applying different mathematical programming techniques including Integer Programming (IP) and Constraint Programming (CP). Our study generates a schedule having carry over effect (COE) value which is one of the lowest ones in European soccer competitions, in addition to minimizing total number of breaks.