Living Reference Work Entry

Handbook of Heuristics

pp 1-27

Date: Latest Version

Variable Neighborhood Descent

  • Abraham DuarteAffiliated withUniversidad Rey Juan Carlos Email author 
  • , Nenad MladenovićAffiliated withLAMIH, France and Mathematical Institute, SANU, Université de Valenciennes
  • , Jesús Sánchez-OroAffiliated withUniversidad Rey Juan Carlos
  • , Raca TodosijevićAffiliated withLAMIH, France and Mathematical Institute, SANU, Université de Valenciennes

Abstract

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.

Keywords

Variable neighborhood descent Local search Intensification Deterministic exploration