Weighted Euclidean Steiner Trees for Disaster-Aware Network Design
Autor(a) principal: | |
---|---|
Data de Publicação: | 2019 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10316/87218 https://doi.org/10.1109/DRCN.2019.8713664 |
Resumo: | We consider the problem of constructing a Euclidean Steiner tree in a setting where the plane has been divided into polygonal regions, each with an associated weight. Given a set of points (terminals), the task is to construct a shortest interconnection of the points, where the cost of a line segment in a region is the Euclidean distance multiplied by the weight of the region. The problem is a natural generalization of the obstacle-avoiding Euclidean Steiner tree problem, and has obvious applications in network design. We propose an efficient heuristic strategy for the problem, and evaluate its performance on both randomly generated and near-realistic problem instances. The minimum cost Euclidean Steiner tree can be seen as an optical backbone network (a Spine) avoiding disaster prone areas, here represented as higher cost regions. |
id |
RCAP_6b1807efe9e5b416660ac65cd4e2aadf |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/87218 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Weighted Euclidean Steiner Trees for Disaster-Aware Network DesignEuclidean Steiner TreeHeuristicCommunicantion Networks ReliabilityWe consider the problem of constructing a Euclidean Steiner tree in a setting where the plane has been divided into polygonal regions, each with an associated weight. Given a set of points (terminals), the task is to construct a shortest interconnection of the points, where the cost of a line segment in a region is the Euclidean distance multiplied by the weight of the region. The problem is a natural generalization of the obstacle-avoiding Euclidean Steiner tree problem, and has obvious applications in network design. We propose an efficient heuristic strategy for the problem, and evaluate its performance on both randomly generated and near-realistic problem instances. The minimum cost Euclidean Steiner tree can be seen as an optical backbone network (a Spine) avoiding disaster prone areas, here represented as higher cost regions.IEEE2019info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/87218http://hdl.handle.net/10316/87218https://doi.org/10.1109/DRCN.2019.8713664eng978-1-5386-8461-0https://ieeexplore.ieee.org/document/8713664Garrote, LuísMartins, LúciaNunes, Urbano J.Zachariasen, Martininfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2021-11-11T10:41:48Zoai:estudogeral.uc.pt:10316/87218Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:08:11.435070Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design |
title |
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design |
spellingShingle |
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design Garrote, Luís Euclidean Steiner Tree Heuristic Communicantion Networks Reliability |
title_short |
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design |
title_full |
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design |
title_fullStr |
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design |
title_full_unstemmed |
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design |
title_sort |
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design |
author |
Garrote, Luís |
author_facet |
Garrote, Luís Martins, Lúcia Nunes, Urbano J. Zachariasen, Martin |
author_role |
author |
author2 |
Martins, Lúcia Nunes, Urbano J. Zachariasen, Martin |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Garrote, Luís Martins, Lúcia Nunes, Urbano J. Zachariasen, Martin |
dc.subject.por.fl_str_mv |
Euclidean Steiner Tree Heuristic Communicantion Networks Reliability |
topic |
Euclidean Steiner Tree Heuristic Communicantion Networks Reliability |
description |
We consider the problem of constructing a Euclidean Steiner tree in a setting where the plane has been divided into polygonal regions, each with an associated weight. Given a set of points (terminals), the task is to construct a shortest interconnection of the points, where the cost of a line segment in a region is the Euclidean distance multiplied by the weight of the region. The problem is a natural generalization of the obstacle-avoiding Euclidean Steiner tree problem, and has obvious applications in network design. We propose an efficient heuristic strategy for the problem, and evaluate its performance on both randomly generated and near-realistic problem instances. The minimum cost Euclidean Steiner tree can be seen as an optical backbone network (a Spine) avoiding disaster prone areas, here represented as higher cost regions. |
publishDate |
2019 |
dc.date.none.fl_str_mv |
2019 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10316/87218 http://hdl.handle.net/10316/87218 https://doi.org/10.1109/DRCN.2019.8713664 |
url |
http://hdl.handle.net/10316/87218 https://doi.org/10.1109/DRCN.2019.8713664 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
978-1-5386-8461-0 https://ieeexplore.ieee.org/document/8713664 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
IEEE |
publisher.none.fl_str_mv |
IEEE |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133974216310784 |