"rsppfp": An R package for the shortest path problem with forbidden paths
- Autores
- Vidoni, Melina; Vecchietti, Aldo
- Año de publicación
- 2019
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution. Though this problem is addressed in the academic literature and has numerous applications, there are no open-source implementations of algorithms that solve it. This article proposes "rsppfp", an R package that offers functionalities that solve the SPPFP by transforming it into the traditional shortest path problem. Its main strengths are its parallel processing capability, and it is high compatibility with packages for other network research. In this paper, we describe the design and functionality of "rsppfp", report an evaluation made with different graph structures, and provide guidelines and examples for its use.
Fil: Vidoni, Melina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
Fil: Vecchietti, Aldo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina - Materia
-
R PACKAGE
SHORTEST PATH
FORBIDDEN PATHS
NETWORK FLOWS - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/108138
Ver los metadatos del registro completo
id |
CONICETDig_5756ee900393ad53a2b5de64b3509904 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/108138 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
"rsppfp": An R package for the shortest path problem with forbidden pathsVidoni, MelinaVecchietti, AldoR PACKAGESHORTEST PATHFORBIDDEN PATHSNETWORK FLOWShttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution. Though this problem is addressed in the academic literature and has numerous applications, there are no open-source implementations of algorithms that solve it. This article proposes "rsppfp", an R package that offers functionalities that solve the SPPFP by transforming it into the traditional shortest path problem. Its main strengths are its parallel processing capability, and it is high compatibility with packages for other network research. In this paper, we describe the design and functionality of "rsppfp", report an evaluation made with different graph structures, and provide guidelines and examples for its use.Fil: Vidoni, Melina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; ArgentinaFil: Vecchietti, Aldo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; ArgentinaElsevier Science2019-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/108138Vidoni, Melina; Vecchietti, Aldo; "rsppfp": An R package for the shortest path problem with forbidden paths; Elsevier Science; SoftwareX; 9; 1-2019; 265-2702352-7110CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/hdl/https://doi.org/10.1016/j.softx.2019.03.004info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S2352711018300955info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:55:24Zoai:ri.conicet.gov.ar:11336/108138instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:55:25.255CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
"rsppfp": An R package for the shortest path problem with forbidden paths |
title |
"rsppfp": An R package for the shortest path problem with forbidden paths |
spellingShingle |
"rsppfp": An R package for the shortest path problem with forbidden paths Vidoni, Melina R PACKAGE SHORTEST PATH FORBIDDEN PATHS NETWORK FLOWS |
title_short |
"rsppfp": An R package for the shortest path problem with forbidden paths |
title_full |
"rsppfp": An R package for the shortest path problem with forbidden paths |
title_fullStr |
"rsppfp": An R package for the shortest path problem with forbidden paths |
title_full_unstemmed |
"rsppfp": An R package for the shortest path problem with forbidden paths |
title_sort |
"rsppfp": An R package for the shortest path problem with forbidden paths |
dc.creator.none.fl_str_mv |
Vidoni, Melina Vecchietti, Aldo |
author |
Vidoni, Melina |
author_facet |
Vidoni, Melina Vecchietti, Aldo |
author_role |
author |
author2 |
Vecchietti, Aldo |
author2_role |
author |
dc.subject.none.fl_str_mv |
R PACKAGE SHORTEST PATH FORBIDDEN PATHS NETWORK FLOWS |
topic |
R PACKAGE SHORTEST PATH FORBIDDEN PATHS NETWORK FLOWS |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution. Though this problem is addressed in the academic literature and has numerous applications, there are no open-source implementations of algorithms that solve it. This article proposes "rsppfp", an R package that offers functionalities that solve the SPPFP by transforming it into the traditional shortest path problem. Its main strengths are its parallel processing capability, and it is high compatibility with packages for other network research. In this paper, we describe the design and functionality of "rsppfp", report an evaluation made with different graph structures, and provide guidelines and examples for its use. Fil: Vidoni, Melina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina Fil: Vecchietti, Aldo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina |
description |
The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution. Though this problem is addressed in the academic literature and has numerous applications, there are no open-source implementations of algorithms that solve it. This article proposes "rsppfp", an R package that offers functionalities that solve the SPPFP by transforming it into the traditional shortest path problem. Its main strengths are its parallel processing capability, and it is high compatibility with packages for other network research. In this paper, we describe the design and functionality of "rsppfp", report an evaluation made with different graph structures, and provide guidelines and examples for its use. |
publishDate |
2019 |
dc.date.none.fl_str_mv |
2019-01 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/108138 Vidoni, Melina; Vecchietti, Aldo; "rsppfp": An R package for the shortest path problem with forbidden paths; Elsevier Science; SoftwareX; 9; 1-2019; 265-270 2352-7110 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/108138 |
identifier_str_mv |
Vidoni, Melina; Vecchietti, Aldo; "rsppfp": An R package for the shortest path problem with forbidden paths; Elsevier Science; SoftwareX; 9; 1-2019; 265-270 2352-7110 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/hdl/https://doi.org/10.1016/j.softx.2019.03.004 info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S2352711018300955 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier Science |
publisher.none.fl_str_mv |
Elsevier Science |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1846083088200761344 |
score |
13.22299 |