Late acceptance hill-climbing for high school timetabling

The application of the Late Acceptance Hill-Climbing (LAHC) to solve the High School Timetabling Problem is the subject of this manuscript. The original algorithm and two variants proposed here are tested jointly with other state-of-art methods to solve the instances proposed in the Third International Timetabling Competition. Following the same rules of the competition, the LAHC-based algorithms noticeably outperformed the winning methods. These results, and reports from the literature, suggest that the LAHC is a reliable method that can compete with the most employed local search algorithms.

[1]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a Three-Phase Approach , 2004, PATAT.

[2]  Anmar Abuhamdah,et al.  Experimental Result of Late Acceptance Randomized Descent Algorithm for Solving Course Timetabling Problems , 2010 .

[3]  Jörg Homberger,et al.  An Evolutionary Algorithm for High School Timetabling , 2012 .

[4]  Jeffrey H. Kingston.  A Tiling Algorithm for High School Timetabling , 2004, PATAT.

[5]  Edmund K. Burke,et al.  Examination timetabling using late acceptance hyper-heuristics , 2009, 2009 IEEE Congress on Evolutionary Computation.

[6]  Edmund K. Burke,et al.  The late acceptance Hill-Climbing heuristic , 2017, Eur. J. Oper. Res..

[7]  Gerhard F. Post,et al.  A Case Study for Timetabling in a Dutch Secondary School , 2006, PATAT.

[8]  Arnaldo Vieira Moura,et al.  A GRASP strategy for a more constrained School Timetabling Problem , 2010 .

[9]  Luciana S. Buriol,et al.  A fix-and-optimize heuristic for the high school timetabling problem , 2014, Comput. Oper. Res..

[10]  Nelishia Pillay,et al.  A survey of school timetabling research , 2014, Ann. Oper. Res..

[11]  Simon Kristiansen,et al.  International Timetabling Competition 2011: An Adaptive Large Neighborhood Search algorithm , 2012 .

[12]  Regina Berretta,et al.  A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem , 2007, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007).

[13]  Efthymios Housos,et al.  Constraint programming approach for school timetabling , 2003, Comput. Oper. Res..

[14]  Marcone J. F. Souza,et al.  A SA-VNS approach for the High School Timetabling Problem , 2012, Electron. Notes Discret. Math..

[15]  Tom.  ITC2007 Solver Description: A Hybrid Approach , 2007 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Mauro Birattari,et al.  International timetabling competition: A hybrid approach , 2003 .

[18]  Thomas R. Stidsen,et al.  Integer programming for the generalized high school timetabling problem , 2015, J. Sched..

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  Nysret Musliu,et al.  XHSTT: an XML archive for high school timetabling problems in different countries , 2014, Ann. Oper. Res..

[21]  Nelson Maculan,et al.  Strong bounds with cut and column generation for class-teacher timetabling , 2012, Ann. Oper. Res..

[22]  Mike Wright,et al.  School Timetabling Using Heuristic Search , 1996 .

[23]  Marcone J. F. Souza,et al.  GOAL solver: a hybrid local search based solver for high school timetabling , 2016, Ann. Oper. Res..

[24]  Ender Özcan,et al.  HySST: Hyper-heuristic Search Strategies and Timetabling , 2012 .

[25]  Greet Van den Berghe,et al.  A Late Acceptance Algorithm for the Lock Scheduling Problem , 2009 .

[26]  Kimmo Nurmi,et al.  A Framework for School Timetabling Problem , 2007 .

[27]  E. Burke,et al.  A Late Acceptance Strategy in Hill-Climbing for Exam Timetabling Problems , 2008 .