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...
Guardado en:
Autores principales: | Pierre Hansen, Nenad Mladenović, Raca Todosijević, Saïd Hanafi |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/5d1a1060d0b449c0ad56b79a04b69e53 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Optimal online k-min search
por: Javeria Iqbal, et al.
Publicado: (2015) -
A robust p-Center problem under pressure to locate shelters in wildfire context
por: Marc Demange, et al.
Publicado: (2020) -
Models for video-on-demand scheduling with costs
por: J.-Ch. Grégoire, et al.
Publicado: (2016) -
Ten years of feasibility pump, and counting
por: Timo Berthold, et al.
Publicado: (2019) -
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights
por: Anjulika Gupta, et al.
Publicado: (2018)