Improving a heuristic repair method for large-scale school timetabling problems

被引:0
|
作者
Kaneko, K [1 ]
Yoshikawa, M [1 ]
Nakakuki, Y [1 ]
机构
[1] NEC Corp Ltd, C&C Media Res Labs, Miyamae Ku, Kawasaki, Kanagawa 2168555, Japan
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Timetable construction is extremely difficult and time- consuming in large high-schools and universities. Even latest high-quality heuristic repair methods leave constraint violations to be fixed manually. This paper describes two improvements, initialization and repair. The improved initialization method applies a heuristic repair method whenever inconsistencies are found during the construction. The improved repair method escapes from local minima by moving two lectures at once in a way similar to the way billiard balls move. Evaluating these methods by using them on real high-school and university timetabling problems showed that they left between 30% and 97% fewer violations than a previous method left.
引用
收藏
页码:275 / 288
页数:14
相关论文
共 50 条
  • [31] A method of substructuring large-scale computational micromechanical problems
    Zohdi, TI
    Wriggers, P
    Huet, C
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2001, 190 (43-44) : 5639 - 5656
  • [32] Solving large-scale multicriteria problems by the decomposition method
    Ya. I. Rabinovich
    Computational Mathematics and Mathematical Physics, 2012, 52 : 60 - 74
  • [33] Solution method for large-scale linear programming problems
    Golikov, AI
    Evtushenko, YG
    DOKLADY MATHEMATICS, 2004, 70 (01) : 615 - 619
  • [34] An overlapping domain decomposition method for large-scale problems
    Santa Agreste
    Angela Ricciardello
    Computational and Applied Mathematics, 2018, 37 : 3744 - 3758
  • [35] Local search techniques for large high school timetabling problems
    Schaerf, A
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1999, 29 (04): : 368 - 377
  • [36] Improving Cache Performance for Large-Scale Photo Stores via Heuristic Prefetching Scheme
    Zhou, Ke
    Sun, Si
    Wang, Hua
    Huang, Ping
    He, Xubin
    Lan, Rui
    Li, Wenyan
    Liu, Wenjie
    Yang, Tianming
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (09) : 2033 - 2045
  • [37] A TECHNIQUE FOR COLOURING A GRAPH APPLICABLE TO LARGE SCALE TIMETABLING PROBLEMS
    WOOD, DC
    COMPUTER JOURNAL, 1969, 12 (04): : 317 - &
  • [38] A spatial parallel heuristic approach for solving very large-scale vehicle routing problems
    Tu, Wei
    Li, Qingquan
    Li, Qiuping
    Zhu, Jiasong
    Zhou, Baoding
    Chen, Biyu
    TRANSACTIONS IN GIS, 2017, 21 (06) : 1130 - 1147
  • [39] A parallel, linear programming-based heuristic for large-scale set partitioning problems
    Linderoth, JT
    Lee, EKL
    Savelsbergh, MWP
    INFORMS JOURNAL ON COMPUTING, 2001, 13 (03) : 191 - 209
  • [40] An efficient heuristic for very large-scale vehicle routing problems with simultaneous pickup and delivery
    Cavaliere, Francesco
    Accorsi, Luca
    Lagana, Demetrio
    Musmanno, Roberto
    Vigo, Daniele
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2024, 186