The University course Timetabling Problem with a three-phase approach

被引：0
|
作者：
Kostuch, P [1 ]
机构：
[1] Univ Oxford, Dept Stat, Oxford OX1 3TG, England
来源：
PRACTICE AND THEORY OF AUTOMATED TIMETABLING V | 2005年 / 3616卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper describes the University Course Timetabling Problem (UCTP) used in the International Timetabling Competition 2003 organized by the Metaheuristics Network and presents a state-of-the-art heuristic approach towards the solution of the competition instances. It is a greatly improved version of the winning competition entry. The heuristic is divided into three phases: at first, a feasible timetable is constructed, then Simulated Annealing (SA) is used to order the thus created time-slots optimally, and finally SA is used to swap individual events between time-slots to improve the solution quality.
引用
收藏
页码：109 / 125
页数：17
相关论文
共 50 条
  • [21] Modeling and solution of a complex university course timetabling problem
    Murray, Keith
    Muller, Tomas
    Rudova, Hana
    PRACTICE AND THEORY OF AUTOMATED TIMETABLING VI, 2007, 3867 : 189 - +
  • [22] Metaheuristic with Cooperative Processes for the University Course Timetabling Problem
    Cruz-Rosales, Martin H.
    Cruz-Chavez, Marco Antonio
    Alonso-Pecina, Federico
    Peralta-Abarca, Jesus del C.
    avila-Melgar, Erika Yesenia
    Martinez-Bahena, Beatriz
    Enriquez-Urbano, Juana
    APPLIED SCIENCES-BASEL, 2022, 12 (02):
  • [23] An Application of Genetic Algorithm for University Course Timetabling Problem
    Deng, Xinyang
    Zhang, Yajuan
    Kang, Bingyi
    Wu, Jiyi
    Sun, Xiaohong
    Deng, Yong
    2011 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, 2011, : 2119 - +
  • [24] Memetic Algorithms for Solving University Course Timetabling Problem
    Ahandani, Morteza Alinia
    Baghmisheh, Mohammad Taghi Vakil
    2011 1ST INTERNATIONAL ECONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE), 2011, : 40 - 44
  • [25] New Constraints and Features for the University Course Timetabling Problem
    Aschinger, M.
    Applebee, S.
    Bucur, A.
    Edmonds, H.
    Hungerlaender, P.
    Maier, K.
    OPERATIONS RESEARCH PROCEEDINGS 2016, 2018, : 95 - 101
  • [26] A Three-Phase Approach to Solving the Bidline Problem
    Jeffery D. Weir
    Ellis L. Johnson
    Annals of Operations Research, 2004, 127 : 283 - 308
  • [27] A three-phase approach to solving the bidline problem
    Weir, JD
    Johnson, EL
    ANNALS OF OPERATIONS RESEARCH, 2004, 127 (1-4) : 283 - 308
  • [28] AN ADAPTED CUCKOO OPTIMIZATION ALGORITHM AND GENETIC ALGORITHM APPROACH TO THE UNIVERSITY COURSE TIMETABLING PROBLEM
    Teoh, Chong
    Wibowo, Antoni
    Ngadiman, Mohd.
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2014, 13 (01)
  • [29] Genetic Algorithm With Three-Dimensional Population Dominance Strategy for University Course Timetabling Problem
    Zhang, Zhifeng
    Ma, Junxia
    Cui, Xiao
    INTERNATIONAL JOURNAL OF GRID AND HIGH PERFORMANCE COMPUTING, 2021, 13 (02) : 56 - 69
  • [30] An iterated local search algorithm for the University Course Timetabling Problem
    Song, Ting
    Liu, Sanya
    Tang, Xiangyang
    Peng, Xicheng
    Chen, Mao
    APPLIED SOFT COMPUTING, 2018, 68 : 597 - 608
12345