Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/2474
Title: Solving the course scheduling problem using simulated annealing
Authors: Aycan, Esra
Ayav, Tolga
Keywords: Simulated annealing
Neighborhood searching
Course scheduling
Execution time
Academic class
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: Aycan, E., and Ayav, T. (2009, March 6-7). Solving the course scheduling problem using simulated annealing. Paper presented at the IEEE International Advance Computing Conference, IACC 2009. doi:10.1109/IADCC.2009.4809055
Abstract: This paper tackles the NP-eomplete problem of academic class scheduling (or timetabling). The aim is to find a feasible timetable for the department of computer engineering in Izmir Institute of Technology. The approach focuses on simulated annealing. We compare the performance of various neighborhood searching algorithms based on so-called simple search, swapping, simple search-swapping and their combinations, taking into account the execution times and the final costs. The most satisfactory timetable is achieved with the combination of all these three algorithms. The results highlight the efficacy of the proposed scheme
Description: IEEE International Advance Computing Conference, IACC 2009; Patiala; India; 6 March 2009 through 7 March 2009
URI: http://doi.org/10.1109/IADCC.2009.4809055
http://hdl.handle.net/11147/2474
ISBN: 9781424429288
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
2474.pdfConference Paper919.17 kBAdobe PDFThumbnail
View/Open
Show full item record



CORE Recommender

SCOPUSTM   
Citations

32
checked on Mar 22, 2024

WEB OF SCIENCETM
Citations

22
checked on Mar 23, 2024

Page view(s)

272
checked on Mar 25, 2024

Download(s)

774
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


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