Solving the Course Scheduling Problem Using Simulated Annealing
| dc.contributor.author | Aycan, Esra | |
| dc.contributor.author | Ayav, Tolga | |
| dc.coverage.doi | 10.1109/IADCC.2009.4809055 | |
| dc.date.accessioned | 2016-11-18T09:54:05Z | |
| dc.date.available | 2016-11-18T09:54:05Z | |
| dc.date.issued | 2009 | |
| dc.description | IEEE International Advance Computing Conference, IACC 2009; Patiala; India; 6 March 2009 through 7 March 2009 | en_US |
| dc.description.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 | en_US |
| dc.identifier.citation | 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 | en_US |
| dc.identifier.doi | 10.1109/IADCC.2009.4809055 | en_US |
| dc.identifier.doi | 10.1109/IADCC.2009.4809055 | |
| dc.identifier.isbn | 9781424429288 | |
| dc.identifier.scopus | 2-s2.0-66249111156 | |
| dc.identifier.uri | http://doi.org/10.1109/IADCC.2009.4809055 | |
| dc.identifier.uri | https://hdl.handle.net/11147/2474 | |
| dc.language.iso | en | en_US |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
| dc.relation.ispartof | IEEE International Advance Computing Conference, IACC 2009 | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Simulated annealing | en_US |
| dc.subject | Neighborhood searching | en_US |
| dc.subject | Course scheduling | en_US |
| dc.subject | Execution time | en_US |
| dc.subject | Academic class | en_US |
| dc.title | Solving the Course Scheduling Problem Using Simulated Annealing | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.institutional | Aycan, Esra | |
| gdc.author.institutional | Ayav, Tolga | |
| gdc.author.yokid | 114453 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C4 | |
| gdc.bip.popularityclass | C4 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Computer Engineering | en_US |
| gdc.description.endpage | 466 | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | N/A | |
| gdc.description.startpage | 462 | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W2085359700 | |
| gdc.identifier.wos | WOS:000274303300086 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 2.0 | |
| gdc.oaire.influence | 5.4737925E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Execution time | |
| gdc.oaire.keywords | Course scheduling | |
| gdc.oaire.keywords | Neighborhood searching | |
| gdc.oaire.keywords | Academic class | |
| gdc.oaire.keywords | Simulated annealing | |
| gdc.oaire.popularity | 7.812276E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.77366024 | |
| gdc.openalex.normalizedpercentile | 0.78 | |
| gdc.openalex.toppercent | TOP 10% | |
| gdc.opencitations.count | 24 | |
| gdc.plumx.crossrefcites | 3 | |
| gdc.plumx.mendeley | 72 | |
| gdc.plumx.scopuscites | 40 | |
| gdc.scopus.citedcount | 40 | |
| gdc.wos.citedcount | 26 | |
| relation.isAuthorOfPublication.latestForDiscovery | 812c2ad4-527f-4a21-8b84-f7497a71f3ce | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4014-8abe-a4dfe192da5e |