On a relaxed maximally disjoint path pair problem: A bicriteria approach
Autor(a) principal: | |
---|---|
Data de Publicação: | 2020 |
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/90443 https://doi.org/10.1111/itor.12624 |
Resumo: | In some application areas in telecommunication and transportation networks, there are problems requiring the determination of pairs of paths, aiming at minimizing the number of links, or link groups that they share, and their total cost. In this paper, a new bicriteria algorithm is proposed to deal with this problem. The algorithm is based on ranking pairs of paths by order of the total cost, using an adaptation of a path-ranking algorithm, after a suitable modification of the network topology. Nondominated solutions are then filtered by means of a dominance test. First, computational experiments are reported in order to assess the efficiency of the algorithm to calculate the whole set of nondominated pairs of paths. Second, we present computational results focused on the nondominated solutions close to the maximal disjoint pair (i.e., quasi-disjoint pairs only, for a predefined admissible relaxation value) because in some application problems, such as shared risk link group pairs of paths, only those solutions have practical relevance. |
id |
RCAP_27efa12e6b88cc3f6e30918dc680ab41 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/90443 |
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 |
On a relaxed maximally disjoint path pair problem: A bicriteria approachBicriteria problems; pairs of paths; maximally disjoint labels; costIn some application areas in telecommunication and transportation networks, there are problems requiring the determination of pairs of paths, aiming at minimizing the number of links, or link groups that they share, and their total cost. In this paper, a new bicriteria algorithm is proposed to deal with this problem. The algorithm is based on ranking pairs of paths by order of the total cost, using an adaptation of a path-ranking algorithm, after a suitable modification of the network topology. Nondominated solutions are then filtered by means of a dominance test. First, computational experiments are reported in order to assess the efficiency of the algorithm to calculate the whole set of nondominated pairs of paths. Second, we present computational results focused on the nondominated solutions close to the maximal disjoint pair (i.e., quasi-disjoint pairs only, for a predefined admissible relaxation value) because in some application problems, such as shared risk link group pairs of paths, only those solutions have practical relevance.Wiley2020info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/90443http://hdl.handle.net/10316/90443https://doi.org/10.1111/itor.12624enghttps://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.12624Pascoal, MartaClímaco, Joãoinfo: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:RCAAP2022-05-25T04:57:47Zoai:estudogeral.uc.pt:10316/90443Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:10:34.776820Repositó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 |
On a relaxed maximally disjoint path pair problem: A bicriteria approach |
title |
On a relaxed maximally disjoint path pair problem: A bicriteria approach |
spellingShingle |
On a relaxed maximally disjoint path pair problem: A bicriteria approach Pascoal, Marta Bicriteria problems; pairs of paths; maximally disjoint labels; cost |
title_short |
On a relaxed maximally disjoint path pair problem: A bicriteria approach |
title_full |
On a relaxed maximally disjoint path pair problem: A bicriteria approach |
title_fullStr |
On a relaxed maximally disjoint path pair problem: A bicriteria approach |
title_full_unstemmed |
On a relaxed maximally disjoint path pair problem: A bicriteria approach |
title_sort |
On a relaxed maximally disjoint path pair problem: A bicriteria approach |
author |
Pascoal, Marta |
author_facet |
Pascoal, Marta Clímaco, João |
author_role |
author |
author2 |
Clímaco, João |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Pascoal, Marta Clímaco, João |
dc.subject.por.fl_str_mv |
Bicriteria problems; pairs of paths; maximally disjoint labels; cost |
topic |
Bicriteria problems; pairs of paths; maximally disjoint labels; cost |
description |
In some application areas in telecommunication and transportation networks, there are problems requiring the determination of pairs of paths, aiming at minimizing the number of links, or link groups that they share, and their total cost. In this paper, a new bicriteria algorithm is proposed to deal with this problem. The algorithm is based on ranking pairs of paths by order of the total cost, using an adaptation of a path-ranking algorithm, after a suitable modification of the network topology. Nondominated solutions are then filtered by means of a dominance test. First, computational experiments are reported in order to assess the efficiency of the algorithm to calculate the whole set of nondominated pairs of paths. Second, we present computational results focused on the nondominated solutions close to the maximal disjoint pair (i.e., quasi-disjoint pairs only, for a predefined admissible relaxation value) because in some application problems, such as shared risk link group pairs of paths, only those solutions have practical relevance. |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020 |
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/90443 http://hdl.handle.net/10316/90443 https://doi.org/10.1111/itor.12624 |
url |
http://hdl.handle.net/10316/90443 https://doi.org/10.1111/itor.12624 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.12624 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Wiley |
publisher.none.fl_str_mv |
Wiley |
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_ |
1799134000362553344 |