Solving the course scheduling problem by constraint programming and simulated annealing
Aycan, Esra.

Solving the course scheduling problem by constraint programming and simulated annealing

Aycan, Esra.

Yazar Ek Girişi
Aycan, Esra.

Yayın Bilgileri
[s.l.]: [s.n.], 2008.

Fiziksel Tanımlama
ix, 80 leaves.: ill. + 1 computer laser optical disc.

In 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.

Konu Başlığı
Constraint programming(Computer science)
Simulated anneling(Mathematics)
Schedules, School.

Yazar Ek Girişi
Ayav Tolga.

Tüzel Kişi Ek Girişi
İzmir Institute of Technology. Computer Engineering.

Tek Biçim Eser Adı
Thesis (Master)--İzmir Institute of Technology:Computer Engineering.
İzmir Institute of Technology:Computer Engineering--Thesis (Master).

Elektronik Erişim
Access to Electronic Version.

KütüphaneMateryal TürüDemirbaş NumarasıYer NumarasıDurumu/İade Tarihi
IYTETezT000238QA76.612 .A974 2008Tez Koleksiyonu