ID Walk: A Candidate List Strategy with a Simple Diversification Device

This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In addition to the number S of moves, ID Walk uses only one parameter Max which is the maximum number of candidate neighbors studied in every move. This candidate list strategy manages the Max candidates so as to obtain a good tradeoff between intensification and diversification.A procedure has also been designed to tune the parameters automatically. We made experiments on several hard combinatorial optimization problems, and ID Walk compares favorably with correspondingly simple instances of leading metaheuristics, notably tabu search, simulated annealing and Metropolis. Thus, among algorithmic variants that are designed to be easy to program and implement, ID Walk has the potential to become an interesting alternative to such recognized approaches.Our automatic tuning tool has also allowed us to compare several variants of ID Walk and tabu search to analyze which devices (parameters) have the greatest impact on the computation time. A surprising result shows that the specific diversification mechanism embedded in ID Walk is very significant, which motivates examination of additional instances in this new class of “dynamic” candidate list strategies.