A general variable neighborhood search for the cyclic antibandwidth problem

Graph Layout Problems refer to a family of optimization problems where the aim is to assign the vertices of an input graph to the vertices of a structured host graph, optimizing a certain objective function. In this paper, we tackle one of these problems, named Cyclic Antibandwidth Problem, where th...

Descripción completa

Detalles Bibliográficos
Autores: Cavero, Sergio, Pardo, Eduardo G., Duarte, Abraham
Tipo de recurso: artículo
Fecha de publicación:2022
País:España
Institución:Universidad Rey Juan Carlos
Repositorio:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
OAI Identifier:oai:burjcdigital.urjc.es:10115/28995
Acceso en línea:https://hdl.handle.net/10115/28995
Access Level:acceso abierto
Palabra clave:Cyclic antibandwidth problems
Graph layout problem
Metaheuristics
Variable neighborhood search
Combinatorial optimization
id ES_7996759c2c8ff031d3c76f4d4e0c3028
oai_identifier_str oai:burjcdigital.urjc.es:10115/28995
network_acronym_str ES
network_name_str España
repository_id_str
spelling A general variable neighborhood search for the cyclic antibandwidth problemCavero, SergioPardo, Eduardo G.Duarte, AbrahamCyclic antibandwidth problemsGraph layout problemMetaheuristicsVariable neighborhood searchCombinatorial optimizationGraph Layout Problems refer to a family of optimization problems where the aim is to assign the vertices of an input graph to the vertices of a structured host graph, optimizing a certain objective function. In this paper, we tackle one of these problems, named Cyclic Antibandwidth Problem, where the objective is to maximize the minimum distance of all adjacent vertices, computed in a cycle host graph. Specifically, we propose a General Variable Neighborhood Search which combines an efficient Variable Neighborhood Descent with a novel destruction–reconstruction shaking procedure. Additionally, our proposal takes advantage of two new exploration strategies for this problem: a criterion for breaking the tie of solutions with the same objective function and an efficient evaluation of neighboring solutions. Furthermore, two new neighborhood reduction strategies are proposed. We conduct a thorough computational experience by comparing the algorithm proposed with the current state-of-the-art methods over a set of previously reported instances. The associated results show the merit of the introduced algorithm, emerging as the best performance method in those instances where the optima are unknown. These results are further confirmed with nonparametric statistical tests.Computational Optimization and Applications (Springer)202420242022info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/10115/28995reponame:BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlosinstname:Universidad Rey Juan CarlosInglésThis version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10589-021-00334-yinfo:eu-repo/semantics/openAccessoai:burjcdigital.urjc.es:10115/289952026-06-24T12:48:17Z
dc.title.none.fl_str_mv A general variable neighborhood search for the cyclic antibandwidth problem
title A general variable neighborhood search for the cyclic antibandwidth problem
spellingShingle A general variable neighborhood search for the cyclic antibandwidth problem
Cavero, Sergio
Cyclic antibandwidth problems
Graph layout problem
Metaheuristics
Variable neighborhood search
Combinatorial optimization
title_short A general variable neighborhood search for the cyclic antibandwidth problem
title_full A general variable neighborhood search for the cyclic antibandwidth problem
title_fullStr A general variable neighborhood search for the cyclic antibandwidth problem
title_full_unstemmed A general variable neighborhood search for the cyclic antibandwidth problem
title_sort A general variable neighborhood search for the cyclic antibandwidth problem
dc.creator.none.fl_str_mv Cavero, Sergio
Pardo, Eduardo G.
Duarte, Abraham
author Cavero, Sergio
author_facet Cavero, Sergio
Pardo, Eduardo G.
Duarte, Abraham
author_role author
author2 Pardo, Eduardo G.
Duarte, Abraham
author2_role author
author
dc.subject.none.fl_str_mv Cyclic antibandwidth problems
Graph layout problem
Metaheuristics
Variable neighborhood search
Combinatorial optimization
topic Cyclic antibandwidth problems
Graph layout problem
Metaheuristics
Variable neighborhood search
Combinatorial optimization
description Graph Layout Problems refer to a family of optimization problems where the aim is to assign the vertices of an input graph to the vertices of a structured host graph, optimizing a certain objective function. In this paper, we tackle one of these problems, named Cyclic Antibandwidth Problem, where the objective is to maximize the minimum distance of all adjacent vertices, computed in a cycle host graph. Specifically, we propose a General Variable Neighborhood Search which combines an efficient Variable Neighborhood Descent with a novel destruction–reconstruction shaking procedure. Additionally, our proposal takes advantage of two new exploration strategies for this problem: a criterion for breaking the tie of solutions with the same objective function and an efficient evaluation of neighboring solutions. Furthermore, two new neighborhood reduction strategies are proposed. We conduct a thorough computational experience by comparing the algorithm proposed with the current state-of-the-art methods over a set of previously reported instances. The associated results show the merit of the introduced algorithm, emerging as the best performance method in those instances where the optima are unknown. These results are further confirmed with nonparametric statistical tests.
publishDate 2022
dc.date.none.fl_str_mv 2022
2024
2024
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/10115/28995
url https://hdl.handle.net/10115/28995
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Computational Optimization and Applications (Springer)
publisher.none.fl_str_mv Computational Optimization and Applications (Springer)
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_ 1869411360644792320
score 15,81155

Similares en LA Referencia