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: | Pierre Hansen, Nenad Mladenović, Raca Todosijević, Saïd Hanafi |
---|---|
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!
|
Documents similaires
-
Optimal online k-min search
par: Javeria Iqbal, et autres
Publié: (2015) -
A robust p-Center problem under pressure to locate shelters in wildfire context
par: Marc Demange, et autres
Publié: (2020) -
Models for video-on-demand scheduling with costs
par: J.-Ch. Grégoire, et autres
Publié: (2016) -
Ten years of feasibility pump, and counting
par: Timo Berthold, et autres
Publié: (2019) -
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
par: Anjulika Gupta, et autres
Publié: (2018)