Variable neighborhood search (VNS) is a meta-heuristic for solving optimization problems, whose basic idea is a systematic change of neighborhood structures in the search for a better solution. During the last 15 years, many variants of VNS have been proposed. In this section we first describe basic VNS procedures and then discuss some recent extensions for solving continuous global optimization problems.