A fast simulated annealing algorithm for the examination timetabling problem

作者：

Highlights：

• A local search algorithm for solving examination timetabling problems is presented.

• Feasible solutions are constructed by means of the saturation degree heuristic.

• A fast variant of the simulated annealing local search algorithm is proposed.

• The effect of the annealing temperature on the exam scheduling is studied.

• Competitive results on the public ITC 2007 benchmark set are attained.

摘要

•A local search algorithm for solving examination timetabling problems is presented.•Feasible solutions are constructed by means of the saturation degree heuristic.•A fast variant of the simulated annealing local search algorithm is proposed.•The effect of the annealing temperature on the exam scheduling is studied.•Competitive results on the public ITC 2007 benchmark set are attained.

论文关键词：Examination timetabling,Hybrid algorithm,ITC 2007 benchmark set,Local search,Simulated annealing,Timetabling

论文评审过程：Received 13 December 2017, Revised 27 December 2018, Accepted 28 December 2018, Available online 29 December 2018, Version of Record 7 January 2019.

论文官网地址：https://doi.org/10.1016/j.eswa.2018.12.048