The rough interval shortest path problem

Detalhes bibliográficos
Autor(a) principal: Moghanni, Ali
Data de Publicação: 2021
Outros Autores: Pascoal, Marta
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/97211
https://doi.org/10.1007/978-3-030-85476-8_5
Resumo: 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.
id RCAP_d3407c65cf57f306103012294fe22444
oai_identifier_str oai:estudogeral.uc.pt:10316/97211
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling The rough interval shortest path problemRough setsShortest pathLabelingEfficient solutionsThe 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.Springer, Cham2021info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/97211http://hdl.handle.net/10316/97211https://doi.org/10.1007/978-3-030-85476-8_5enghttps://link.springer.com/chapter/10.1007/978-3-030-85476-8_5Moghanni, AliPascoal, Martainfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2022-05-25T06:59:00Zoai:estudogeral.uc.pt:10316/97211Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:15:14.809835Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv The rough interval shortest path problem
title The rough interval shortest path problem
spellingShingle The rough interval shortest path problem
Moghanni, Ali
Rough sets
Shortest path
Labeling
Efficient solutions
title_short The rough interval shortest path problem
title_full The rough interval shortest path problem
title_fullStr The rough interval shortest path problem
title_full_unstemmed The rough interval shortest path problem
title_sort The rough interval shortest path problem
author Moghanni, Ali
author_facet Moghanni, Ali
Pascoal, Marta
author_role author
author2 Pascoal, Marta
author2_role author
dc.contributor.author.fl_str_mv Moghanni, Ali
Pascoal, Marta
dc.subject.por.fl_str_mv Rough sets
Shortest path
Labeling
Efficient solutions
topic Rough sets
Shortest path
Labeling
Efficient solutions
description 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.
publishDate 2021
dc.date.none.fl_str_mv 2021
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/97211
http://hdl.handle.net/10316/97211
https://doi.org/10.1007/978-3-030-85476-8_5
url http://hdl.handle.net/10316/97211
https://doi.org/10.1007/978-3-030-85476-8_5
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://link.springer.com/chapter/10.1007/978-3-030-85476-8_5
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Springer, Cham
publisher.none.fl_str_mv Springer, Cham
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799134049419132928

Registros relacionados