Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/97211
Title: | The rough interval shortest path problem | Authors: | Moghanni, Ali Pascoal, Marta |
Keywords: | Rough sets; Shortest path; Labeling; Efficient solutions | Issue Date: | 2021 | Publisher: | Springer, Cham | Project: | UID/Multi/00308/2019 CENTRO-01-0145-FEDER-029312 UIDB/00324/2020 |
Serial title, monograph or event: | Operational Research. APDIO 2019. Springer Proceedings in Mathematics & Statistics. | Volume: | 374 | Abstract: | The shortest path problem is one of the most popular network optimization problems and it is of great importance in areas such as transportation, network design or telecommunications. This model deals with determining a minimum weighted path between a pair of nodes of a given network. The deterministic version of the problem can be solved easily, in polynomial time, but sometimes uncertainty or vagueness is encountered. In this work we consider the rough interval shortest path problem, where each arc’s weight is represented by a lower approximation interval and an upper approximation interval, which surely contains the real weight value and that may possibly contain the real weight value, respectively. A labeling algorithm is developed to find the set of efficient solutions of the problem. | URI: | https://hdl.handle.net/10316/97211 | DOI: | https://doi.org/10.1007/978-3-030-85476-8_5 | Rights: | embargoedAccess |
Appears in Collections: | I&D INESCC - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MoghanniPascoalEGeral.pdf | 253.16 kB | Adobe PDF | View/Open |
Page view(s)
122
checked on Sep 10, 2024
Download(s)
59
checked on Sep 10, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.