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
相关论文
共 50 条
  • [1] Solving the flowshop scheduling problem using simulated annealing
    Yang, G. (yanggelan@126.com), 1600, Advanced Institute of Convergence Information Technology, Myoungbo Bldg 3F,, Bumin-dong 1-ga, Seo-gu, Busan, 602-816, Korea, Republic of (04):
  • [2] Solving the medical student scheduling problem using simulated annealing
    Zanazzo, Eugenia
    Ceschia, Sara
    Dovier, Agostino
    Schaerf, Andrea
    JOURNAL OF SCHEDULING, 2024,
  • [3] Solving for a Quay Crane Scheduling and Assignment Problem by Simulated Annealing
    Tavakkoli-Moghaddam, Reza
    Taheri, Farid
    Bazzazi, Mohammad
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 326 - 333
  • [4] Solving Cutting Scheduling Problem by Simulated Annealing Search Method
    Tung, Kuan-Ting
    Chen, Chih-Yu
    Hung, Yi-Feng
    2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2016, : 907 - 911
  • [5] Solving scheduling problems by simulated annealing
    Catoni, O
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1998, 36 (05) : 1639 - 1675
  • [6] Solving a single machine stochastic scheduling problem using a branch and bound algorithm and simulated annealing
    Mazdeh, Mohammad Mahdavi
    Haddad, Hamidreza
    Ghanbari, Payam
    INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2012, 7 (02) : 110 - 118
  • [7] Comparative performance of Simulated Annealing and Genetic Algorithm in solving Nurse Scheduling Problem
    Kundu, S.
    Mahato, M.
    Mahanty, B.
    Acharyya, S.
    IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 96 - 100
  • [8] Fast simulated annealing hybridized with quenching for solving job shop scheduling problem
    Akram, Kashif
    Kamal, Khurram
    Zeb, Alam
    APPLIED SOFT COMPUTING, 2016, 49 : 510 - 523
  • [9] Solving the single machine total weighted tardiness scheduling problem using a hybrid simulated annealing algorithm
    Nearchou, AC
    2004 2ND IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS: COLLABORATIVE AUTOMATION - ONE KEY FOR INTELLIGENT INDUSTRIAL ENVIRONMENTS, 2004, : 513 - 516
  • [10] Simulated annealing for grid scheduling problem
    Fidanova, Stefka
    IEEE JOHN VINCENT ATANASOFF 2006 INTERNATIONAL SYMPOSIUM ON MODERN COMPUTING, PROCEEDINGS, 2006, : 41 - 45
12345