Solving the Course Scheduling Problem Using Simulated Annealing

被引：23

作者：

Aycan, E. ^{[1
]}

Ayav, T. ^{[1
]}

机构：

[1] Izmir Inst Technol, Dept Comp Engn, Izmir, Turkey

来源：

2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3 | 2009年

关键词：

course scheduling; simulated annealing; neighborhood searching;

D O I：

10.1109/IADCC.2009.4809055

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper tackles the NP-complete 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.

引用

页码：462 / 466

页数：5

共 19 条

[1] University course timetabling using constraint handling rules [J].