Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/2474
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAycan, Esra-
dc.contributor.authorAyav, Tolga-
dc.date.accessioned2016-11-18T09:54:05Z-
dc.date.available2016-11-18T09:54:05Z-
dc.date.issued2009-
dc.identifier.citationAycan, 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.4809055en_US
dc.identifier.isbn9781424429288-
dc.identifier.urihttp://doi.org/10.1109/IADCC.2009.4809055-
dc.identifier.urihttp://hdl.handle.net/11147/2474-
dc.descriptionIEEE International Advance Computing Conference, IACC 2009; Patiala; India; 6 March 2009 through 7 March 2009en_US
dc.description.abstractThis 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 schemeen_US
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.relation.ispartofIEEE International Advance Computing Conference, IACC 2009en_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectSimulated annealingen_US
dc.subjectNeighborhood searchingen_US
dc.subjectCourse schedulingen_US
dc.subjectExecution timeen_US
dc.subjectAcademic classen_US
dc.titleSolving the course scheduling problem using simulated annealingen_US
dc.typeConference Objecten_US
dc.authoridTR114453en_US
dc.institutionauthorAycan, Esra-
dc.institutionauthorAyav, Tolga-
dc.departmentİzmir Institute of Technology. Computer Engineeringen_US
dc.identifier.startpage462en_US
dc.identifier.endpage466en_US
dc.identifier.wosWOS:000274303300086en_US
dc.identifier.scopus2-s2.0-66249111156en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.identifier.doi10.1109/IADCC.2009.4809055-
dc.relation.doi10.1109/IADCC.2009.4809055en_US
dc.coverage.doi10.1109/IADCC.2009.4809055en_US
dc.identifier.wosqualityttpTop10%en_US
item.openairetypeConference Object-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.grantfulltextopen-
crisitem.author.dept03.05. Department of Electrical and Electronics Engineering-
crisitem.author.dept03.04. Department of Computer Engineering-
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 simple 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.