Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/90443
DC FieldValueLanguage
dc.contributor.authorPascoal, Marta-
dc.contributor.authorClímaco, João-
dc.date.accessioned2020-07-10T09:59:00Z-
dc.date.available2020-07-10T09:59:00Z-
dc.date.issued2020-
dc.identifier.urihttp://hdl.handle.net/10316/90443-
dc.description.abstractIn 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.pt
dc.language.isoengpt
dc.publisherWileypt
dc.relationUID/MAT/00324/2019pt
dc.relationUID/MULTI/00308/2013pt
dc.relationCENTRO-01-0145-FEDER-029312pt
dc.rightsembargoedAccesspt
dc.subjectBicriteria problems; pairs of paths; maximally disjoint labels; costpt
dc.titleOn a relaxed maximally disjoint path pair problem: A bicriteria approachpt
dc.typearticle-
degois.publication.firstPage2045pt
degois.publication.lastPage2063pt
degois.publication.issue27pt
degois.publication.titleInternational Transactions in Operational Researchpt
dc.relation.publisherversionhttps://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.12624pt
dc.peerreviewedyespt
dc.identifier.doi10.1111/itor.12624pt
dc.date.embargo2020-12-31*
uc.date.periodoEmbargo365pt
item.grantfulltextembargo_20201231-
item.languageiso639-1en-
item.fulltextCom Texto completo-
crisitem.author.deptFaculdade de Ciências e Tecnologia, Universidade de Coimbra-
crisitem.author.deptFaculdade de Economia, Universidade de Coimbra-
crisitem.author.parentdeptUniversidade de Coimbra-
crisitem.author.researchunitCenter for Mathematics, University of Coimbra-
crisitem.author.researchunitInstitute for Systems Engineering and Computers at Coimbra-
crisitem.author.orcid0000-0003-0517-677X-
crisitem.author.orcid0000-0001-6655-8590-
Appears in Collections:I&D INESCC - Artigos em Revistas Internacionais
I&D CMUC - Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat Login
PascoalClimacoDec2018.pdf415.11 kBAdobe PDFEmbargo Access    Request a copy
Show simple item record

Page view(s)

69
checked on Oct 27, 2020

Download(s)

7
checked on Oct 27, 2020

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.