Variable neighborhood search: basics and variants
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...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2017
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/5d1a1060d0b449c0ad56b79a04b69e53 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| Résumé: | 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. |
|---|