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.
KeywordsVariable neighborhood descent Local search Intensification Deterministic exploration
The works of Nenad Mladenović and Raca Todosijević are partly supported by the Ministry of Education and Science, Republic of Kazakhstan (Institute of Information and Computer Technologies), project number 0115PK00546, and also by the Ministry of Education, Science and Technological Development of Serbia, project number 174010. The works of Abraham Duarte and Jesús Sánchez-Oro are partly supported by the Spanish “Ministerio de Economía y Competitividad” and by “Comunidad de Madrid” with grants refs. TIN2012-35632-C02 and S2013/ICE-2894, respectively.
- 14.Glover F (1998) A template for scatter search and path relinking. In: Selected papers from the third European conference on artificial evolution, AE’97. Springer, London, pp 3–54Google Scholar
- 15.Hansen P, Mladenović N (1999) An introduction to variable neighborhood search. In: Meta-Heuristics. Springer, Boston, pp 433–458Google Scholar
- 18.Hansen P, Mladenović N, Todosijević R, Hanafi S (2016) Variable neighborhood search: basics and variants. EURO J Comput Optim 1–32. DOI:10.1007/s13675-016-0075-xGoogle Scholar
- 19.Holland JH (1992) Adaptation in natural and artificial systems. MIT Press, Cambridge, MAGoogle Scholar
- 20.Hoos H, Süttzle T (2004) Stochastic local search: foundations & applications. Morgan Kaufmann Publishers Inc., San FranciscoGoogle Scholar
- 31.Mjirda A, Todosijević R, Hanafi S, Hansen P, Mladenović N (2016) Sequential variable neighborhood descent variants: an empirical study on travelling salesman problem. Int Trans Oper Res. DOI:10.1111/itor.12282Google Scholar
- 40.Sánchez Oro J, Mladenović N, Duarte A (2014) General variable neighborhood search for computing graph separators. Optim Lett 1–21. doi:10.1007/s11590-014-0793-zGoogle Scholar
- 41.Sánchez Oro J, Pantrigo JJ, Duarte A (2014) Combining intensification and diversification strategies in VNS. An application to the vertex separation problem. Comput Oper Res 52, Part B(0):209–219. Recent advances in variable neighborhood searchGoogle Scholar
- 43.Todosijević R, Urošević D, Mladenović N, Hanafi S (2015) A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim Lett. doi:10.1007/s11590-015-0867-6Google Scholar