Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/90443
Título: | On a relaxed maximally disjoint path pair problem: A bicriteria approach | Autor: | Pascoal, Marta Clímaco, João |
Palavras-chave: | Bicriteria problems; pairs of paths; maximally disjoint labels; cost | Data: | 2020 | Editora: | Wiley | Projeto: | UID/MAT/00324/2019 UID/MULTI/00308/2013 CENTRO-01-0145-FEDER-029312 |
Título da revista, periódico, livro ou evento: | International Transactions in Operational Research | Número: | 27 | 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. | URI: | https://hdl.handle.net/10316/90443 | DOI: | 10.1111/itor.12624 | Direitos: | embargoedAccess |
Aparece nas coleções: | I&D CMUC - Artigos em Revistas Internacionais I&D INESCC - Artigos em Revistas Internacionais |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
PascoalClimacoDec2018.pdf | 415.11 kB | Adobe PDF | Ver/Abrir |
Citações SCOPUSTM
2
Visto em 17/nov/2022
Citações WEB OF SCIENCETM
20
2
Visto em 2/mai/2023
Visualizações de página
191
Visto em 24/abr/2024
Downloads
148
Visto em 24/abr/2024
Google ScholarTM
Verificar
Altmetric
Altmetric
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.