Variable neighborhood search: basics and variants

被引:276
作者
Hansen, Pierre [1 ]
Mladenović, Nenad [2 ,3 ]
Todosijević, Raca [2 ,3 ]
Hanafi, Saïd [2 ]
机构
[1] GERAD and HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal,QC, Canada
[2] LAMIH-UVHC, CNRS UMR 8201, Le Mont Houy, Valenciennes Cedex 9, France
[3] Mathematical Institute, SANU, Belgrade, Serbia
关键词
Operations research;
D O I
10.1007/s13675-016-0075-x
中图分类号
学科分类号
摘要
Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a local minimum, and in a perturbation phase to escape from the corresponding valley. In this paper, we present some of VNS basic schemes as well as several VNS variants deduced from these basic schemes. In addition, the paper includes parallel implementations and hybrids with other metaheuristics. © 2016, EURO - The Association of European Operational Research Societies.
引用
收藏
页码:423 / 454
相关论文
empty
未找到相关数据