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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Pierre Hansen, Nenad Mladenović, Raca Todosijević, Saïd Hanafi
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2017
Materias:	90C59 68T20 68W25 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/5d1a1060d0b449c0ad56b79a04b69e53
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:5d1a1060d0b449c0ad56b79a04b69e53
record_format	dspace
spelling	oai:doaj.org-article:5d1a1060d0b449c0ad56b79a04b69e532021-12-02T05:01:03ZVariable neighborhood search: basics and variants2192-440610.1007/s13675-016-0075-xhttps://doaj.org/article/5d1a1060d0b449c0ad56b79a04b69e532017-09-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000873https://doaj.org/toc/2192-4406Variable 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.Pierre HansenNenad MladenovićRaca TodosijevićSaïd HanafiElsevierarticle90C5968T2068W25Applied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 5, Iss 3, Pp 423-454 (2017)
institution	DOAJ
collection	DOAJ
language	EN
topic	90C59 68T20 68W25 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90C59 68T20 68W25 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Pierre Hansen Nenad Mladenović Raca Todosijević Saïd Hanafi Variable neighborhood search: basics and variants
description	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.
format	article
author	Pierre Hansen Nenad Mladenović Raca Todosijević Saïd Hanafi
author_facet	Pierre Hansen Nenad Mladenović Raca Todosijević Saïd Hanafi
author_sort	Pierre Hansen
title	Variable neighborhood search: basics and variants
title_short	Variable neighborhood search: basics and variants
title_full	Variable neighborhood search: basics and variants
title_fullStr	Variable neighborhood search: basics and variants
title_full_unstemmed	Variable neighborhood search: basics and variants
title_sort	variable neighborhood search: basics and variants
publisher	Elsevier
publishDate	2017
url	https://doaj.org/article/5d1a1060d0b449c0ad56b79a04b69e53
work_keys_str_mv	AT pierrehansen variableneighborhoodsearchbasicsandvariants AT nenadmladenovic variableneighborhoodsearchbasicsandvariants AT racatodosijevic variableneighborhoodsearchbasicsandvariants AT saidhanafi variableneighborhoodsearchbasicsandvariants
_version_	1718400830119346176

Variable neighborhood search: basics and variants

Ejemplares similares