Variable Neighborhood Descent - Université Polytechnique des Hauts-de-France Access content directly
Book Sections Year : 2018

Variable Neighborhood Descent


Local search heuristic that explores several neighborhood structures in a deterministic way is called variable neighborhood descent (VND). Its success is based on the simple fact that different neighborhood structures do not usually have the same local minimum. Thus, the local optima trap problem may be resolved by deterministic change of neighborhoods. VND may be seen as a local search routine and therefore could be used within other metaheuristics. In this chapter, we discuss typical problems that arise in developing VND heuristic: what neighborhood structures could be used, what would be their order, what rule of their change during the search would be used, etc. Comparative analysis of usual sequential VND variants is performed in solving traveling salesman problem
No file

Dates and versions

hal-03674503 , version 1 (20-05-2022)



Abraham Duarte, Nenad Mladenovic, Jesús Sánchez-Oro, Raca Todosijević. Variable Neighborhood Descent. Handbook of Heuristics, Springer International Publishing, pp.341-367, 2018, 978-331907124-4. ⟨10.1007/978-3-319-07124-4_9⟩. ⟨hal-03674503⟩
204 View
0 Download



Gmail Facebook Twitter LinkedIn More