A Tutorial on Variable Neighborhood Search (2003)
| Venue: | Les Cahiers du GERAD, HEC Montreal and GERAD |
| Citations: | 15 - 2 self |
BibTeX
@TECHREPORT{Hansen03atutorial,
author = {Pierre Hansen and Pierre Hansen and Nenad Mladenovic and Nenad Mladenović and Les Cahiers Du Gerad},
title = {A Tutorial on Variable Neighborhood Search},
institution = {Les Cahiers du GERAD, HEC Montreal and GERAD},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood change, both in the descent to local minima and in the escape from the valleys which contain them. In this tutorial we first present the ingredients of VNS, i.e., Variable Neighborhood Descent (VND) and Reduced VNS (RVNS) followed by the basic and then the general scheme of VNS itself which contain both of them. Extensions are presented, in particular Skewed VNS (SVNS) which enhances exploration of far away valleys and Variable Neighborhood Decomposition Search (VNDS), a two-level scheme for solution of large instances of various problems. In each case, we present the scheme, some illustrative examples and questions to be addressed in order to obtain an e#cient implementation.
