Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/44387
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Pascoal, Marta | - |
dc.contributor.author | Resende, Marisa | - |
dc.date.accessioned | 2017-11-14T14:58:55Z | - |
dc.date.issued | 2014 | - |
dc.identifier.uri | https://hdl.handle.net/10316/44387 | - |
dc.description.abstract | The 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.iso | eng | por |
dc.publisher | Elsevier | por |
dc.rights | embargoedAccess | - |
dc.title | The minmax regret robust shortest path problem in a finite multi-scenario model | por |
dc.type | article | - |
degois.publication.firstPage | 88 | por |
degois.publication.lastPage | 111 | por |
degois.publication.title | Applied Mathematics and Computation | por |
dc.relation.publisherversion | https://doi.org/10.1016/j.amc.2014.04.076 | por |
dc.peerreviewed | yes | por |
dc.identifier.doi | 10.1016/j.amc.2014.04.076 | por |
dc.identifier.doi | 10.1016/j.amc.2014.04.076 | - |
degois.publication.volume | 241 | por |
dc.date.embargo | 2019-11-14T14:58:55Z | - |
item.fulltext | Com Texto completo | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | open | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.orcid | 0000-0003-0517-677X | - |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2014PascoalResende.pdf | 612.55 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
10
checked on Oct 14, 2024
WEB OF SCIENCETM
Citations
10
9
checked on Oct 2, 2024
Page view(s)
307
checked on Oct 22, 2024
Download(s) 50
459
checked on Oct 22, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.