摘要: Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood change, both in descent to local minima and escape from valleys contain them. In this tutorial we first present ingredients VNS, i.e., Descent (VND) Reduced VNS (RVNS) followed by basic then general scheme itself Extensions are presented, particular Skewed (SVNS) enhances exploration far away Decomposition (VNDS), two-level solution large instances various problems. each case, scheme, some illustrative examples questions be addressed order obtain an efficient implementation.