A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling

作者：Bykov Yuri; Petrovic Sanja^*

来源：Journal of Scheduling, 2016, 19(4): 479-492.

DOI：10.1007/s10951-016-0469-x

• Optimisation
• Metaheuristics
• Simulated annealing
• Late acceptance hill climbing
• Step counting hill climbing
• Exam timetabling

This paper presents a new single-parameter local search heuristic named step counting hill climbing algorithm (SCHC). It is a very simple method in which the current cost serves as an acceptance bound for a number of consecutive steps. This is the only parameter in the method that should be set up by the user. Furthermore, the counting of steps can be organised in different ways; therefore, the proposed method can generate a large number of variants and also extensions. In this paper, we investigate the behaviour of the three basic variants of SCHC on the university exam timetabling problem. Our experiments demonstrate that the proposed method shares the main properties with the late acceptance hill climbing method, namely its convergence time is proportional to the value of its parameter and a non-linear rescaling of a problem does not affect its search performance. However, our new method has two additional advantages: a more flexible acceptance condition and better overall performance. In this study, we compare the new method with late acceptance hill climbing, simulated annealing and great deluge algorithm. The SCHC has shown the strongest performance on the most of our benchmark problems used.

• 出版日期2016-8