Speeding Up Hyper-Heuristics With Markov-Chain Operator Selection and the Only-Worsening Acceptance Operator

The move-acceptance hyper-heuristic was recently shown to be able to leave local optima with astonishing efficiency (Lissovoi et al., Artificial Intelligence (2023)). In this work, we propose two modifications to this algorithm that demonstrate impressive performances on a large class of benchmarks including the classic Cliffd and Jumpm function classes. (i) Instead of randomly choosing between the only-improving and any-move acceptance operator, we take this choice via a simple two-state Markov chain. This modification alone reduces the runtime on Jumpm functions with gap parameter m from Omega(n2m-1) to O(nm+1). (ii) We then replace the all-moves acceptance operator with the operator that only accepts worsenings. Such a, counter-intuitive, operator has not been used before in the literature. However, our proofs show that our only-worsening operator can greatly help in leaving local optima, reducing, e.g., the runtime on Jump functions to O(n3 log n) independent of the gap size. In general, we prove a remarkably good runtime of O(nk+1 log n) for our Markov move-acceptance hyper-heuristic on all members of a new benchmark class SEQOPTk, which contains a large number of functions having k successive local optima, and which contains the commonly studied Jumpm and Cliffd functions for k=2.