Skip to main content

Research Repository

Advanced Search

A step counting hill climbing algorithm

Bykov, Yuri; Petrovic, Sanja

A step counting hill climbing algorithm Thumbnail


Authors

Yuri Bykov

SANJA PETROVIC SANJA.PETROVIC@NOTTINGHAM.AC.UK
Professor of Operational Research



Abstract

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 organized 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 Step Counting Hill Climbing has shown the strongest performance on the most of our benchmark problems used.

Citation

Bykov, Y., & Petrovic, S. (2016). A step counting hill climbing algorithm. Journal of Scheduling, 19(4), https://doi.org/10.1007/s10951-016-0469-x

Journal Article Type Article
Acceptance Date Dec 15, 2015
Online Publication Date Apr 2, 2016
Publication Date Aug 1, 2016
Deposit Date Apr 25, 2016
Publicly Available Date Mar 29, 2024
Journal Journal of Scheduling
Print ISSN 1094-6136
Electronic ISSN 1099-1425
Publisher Springer Verlag
Peer Reviewed Peer Reviewed
Volume 19
Issue 4
DOI https://doi.org/10.1007/s10951-016-0469-x
Keywords Optimisation, Metaheuristics, Simulated Annealing, Late Acceptance Hill Climbing, Step Counting Hill Climbing, Exam Timetabling
Public URL https://nottingham-repository.worktribe.com/output/975410
Publisher URL http://link.springer.com/article/10.1007%2Fs10951-016-0469-x

Files





You might also like



Downloadable Citations