An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems

Variable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on a systematic change of neighborhoods. In recent years, a large variety of VNS strategies have been proposed. However, we have only found limited experimental comparisons among different VNS variants. Thi...

Full description

Bibliographic Details
Authors: Sánchez-Oro, Jesús, Duarte, Abraham
Format: article
Publication Date:2012
Country:España
Institution:Universidad Rey Juan Carlos
Repository:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
OAI Identifier:oai:burjcdigital.urjc.es:10115/12380
Online Access:http://hdl.handle.net/10115/12380
Access Level:Open access
Keyword:Informática
Ciencias de la Computación
VNS
Profile
Vertex Separation
metaheuristic
3304.06 Arquitectura de Ordenadores
1203.17 Informática
id ES_b4bab33e6a2c02464632e3a07da587b3
oai_identifier_str oai:burjcdigital.urjc.es:10115/12380
network_acronym_str ES
network_name_str España
repository_id_str
spelling An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problemsSánchez-Oro, JesúsDuarte, AbrahamInformáticaCiencias de la ComputaciónVNSProfileVertex Separationmetaheuristic3304.06 Arquitectura de Ordenadores1203.17 InformáticaVariable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on a systematic change of neighborhoods. In recent years, a large variety of VNS strategies have been proposed. However, we have only found limited experimental comparisons among different VNS variants. This paper reviews three VNS strategies for finding near-optimal solutions for vertex-cut minimization problems. Specifically, we consider the min-max variant (Vertex Separation Problem) and the min-sum variant (SumCut Minimization Problem). We also present an preliminary computational comparison of the methods on previously reported instances.Ciencias de la ComputaciónElsevier201420142012info:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10115/12380reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlosinstname:Universidad Rey Juan CarlosInglésS2009/TIC-1542Atribución-NoComercial-SinDerivadas 3.0 Españahttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:burjcdigital.urjc.es:10115/123802026-06-24T12:48:17Z
dc.title.none.fl_str_mv An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
title An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
spellingShingle An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
Sánchez-Oro, Jesús
Informática
Ciencias de la Computación
VNS
Profile
Vertex Separation
metaheuristic
3304.06 Arquitectura de Ordenadores
1203.17 Informática
title_short An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
title_full An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
title_fullStr An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
title_full_unstemmed An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
title_sort An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems
dc.creator.none.fl_str_mv Sánchez-Oro, Jesús
Duarte, Abraham
author Sánchez-Oro, Jesús
author_facet Sánchez-Oro, Jesús
Duarte, Abraham
author_role author
author2 Duarte, Abraham
author2_role author
dc.subject.none.fl_str_mv Informática
Ciencias de la Computación
VNS
Profile
Vertex Separation
metaheuristic
3304.06 Arquitectura de Ordenadores
1203.17 Informática
topic Informática
Ciencias de la Computación
VNS
Profile
Vertex Separation
metaheuristic
3304.06 Arquitectura de Ordenadores
1203.17 Informática
description Variable Neighborhood Search (VNS) is a metaheuristic for solving optimization problems based on a systematic change of neighborhoods. In recent years, a large variety of VNS strategies have been proposed. However, we have only found limited experimental comparisons among different VNS variants. This paper reviews three VNS strategies for finding near-optimal solutions for vertex-cut minimization problems. Specifically, we consider the min-max variant (Vertex Separation Problem) and the min-sum variant (SumCut Minimization Problem). We also present an preliminary computational comparison of the methods on previously reported instances.
publishDate 2012
dc.date.none.fl_str_mv 2012
2014
2014
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/10115/12380
url http://hdl.handle.net/10115/12380
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv S2009/TIC-1542
dc.rights.none.fl_str_mv Atribución-NoComercial-SinDerivadas 3.0 España
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Atribución-NoComercial-SinDerivadas 3.0 España
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
instname:Universidad Rey Juan Carlos
instname_str Universidad Rey Juan Carlos
reponame_str BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
collection BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869417285040472064
score 15,812429

Similar Items