Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/44387
DC FieldValueLanguage
dc.contributor.authorPascoal, Marta-
dc.contributor.authorResende, Marisa-
dc.date.accessioned2017-11-14T14:58:55Z-
dc.date.issued2014-
dc.identifier.urihttp://hdl.handle.net/10316/44387-
dc.description.abstractThe robust shortest path problem is a network optimization problem that can be defined to deal with uncertainty of costs associated with the arcs of a network. Two models have been considered for the robust shortest path problem: interval data and discrete data sets. This work addresses the robust shortest path problem with a minmax regret objective function on a finite multi-scenario model. This problem consists in finding an optimal path in the sense that it has the minimum maximum deviation from the shortest one over all scenarios. With this goal some properties of the problem and of its optimal solutions are derived. These results allow to introduce three approaches, a labeling algorithm, an algorithm based on ranking loopless paths, and a hybrid algorithm which ranks loopless paths in a suitable way to apply the early elimination of useless solutions. The algorithms are tested on random networks and compared with a previous method for the same problem. The obtained computational results are reported and discussed. They show that the labeling and the hybrid approaches outperform the others.por
dc.language.isoengpor
dc.publisherElsevierpor
dc.rightsembargoedAccess-
dc.titleThe minmax regret robust shortest path problem in a finite multi-scenario modelpor
dc.typearticle-
degois.publication.firstPage88por
degois.publication.lastPage111por
degois.publication.titleApplied Mathematics and Computationpor
dc.relation.publisherversionhttps://doi.org/10.1016/j.amc.2014.04.076por
dc.peerreviewedyespor
dc.identifier.doi10.1016/j.amc.2014.04.076por
dc.identifier.doi10.1016/j.amc.2014.04.076-
degois.publication.volume241por
dc.date.embargo2019-11-14T14:58:55Z-
item.grantfulltextopen-
item.fulltextCom Texto completo-
item.languageiso639-1en-
crisitem.author.deptFaculty of Sciences and Technology-
crisitem.author.parentdeptUniversity of Coimbra-
crisitem.author.researchunitCMUC - Centre for Mathematics of the University of Coimbra-
crisitem.author.orcid0000-0003-0517-677X-
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
2014PascoalResende.pdf612.55 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

7
checked on May 29, 2020

WEB OF SCIENCETM
Citations 10

8
checked on Aug 2, 2022

Page view(s)

221
checked on Sep 16, 2022

Download(s) 50

383
checked on Sep 16, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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