Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/3987
Title: Solving the course scheduling problem by constraint programming and simulated annealing
Authors: Ayav, Tolga
Aycan, Esra
Issue Date: 2008
Publisher: Izmir Institute of Technology
Abstract: 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.
Description: Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2008
Includes bibliographical references (leaves: 87-62)
Text in English; Abstract: Turkish and English
ix, 80 leaves
URI: http://hdl.handle.net/11147/3987
Appears in Collections:Master Degree / Yüksek Lisans Tezleri

Files in This Item:
File Description SizeFormat 
T000238.pdfMasterThesis1.37 MBAdobe PDFThumbnail
View/Open
Show full item record

CORE Recommender

Page view(s)

42,318
checked on Jan 30, 2023

Download(s)

44
checked on Jan 30, 2023

Google ScholarTM

Check


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.