Adaptive Sampled Walk: A Simple and Efficient Autonomous Local Search
提出一种无需参数调优的自适应局部搜索方法，通过滑动窗口距离计算动态决定邻居评估数量，在多种组合优化问题上取得与调参版本相当的稳健结果。
We introduce and explore the automation and adaptation of partial neighborhood local search. Unlike traditional approaches requiring extensive parameter tuning, we design our approach to operate with minimal prerequisites. Specifically, we extend the sampled walk and ID walk algorithms by using distance-based calculations over a sliding window to determine the number of neighbors to evaluate at each step. To validate their performance, we empirically evaluate these parameter-free methods on four challenging combinatorial optimization benchmark problem classes from the literature, comparing them against fixed-parameter versions across multiple values. Our experiments show that, despite their simplicity, generic nature, and absence of parameters, these approaches achieve robust and competitive results across diverse problems-including different solution representations, neighborhood structures, and fitness landscape characteristics-thus validating the viability of generic autonomous local search methods.