Towards an R Package for the Shortest Path Problem with Forbidden Paths
- Autores
- Vidoni, Melina C.; Vecchietti, Aldo R.
- Año de publicación
- 2018
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- The shortest path problem with forbidden paths (SPPFP) is a variant of the original shortest path problem. Given a directed graph = (, ), there is also a related set of known forbidden sub-paths in . The problem is to find the shortest paths from a source to a destination node, with no paths in the solution contain forbidden sub-path. SPPFP has been addressed in the academic literature, and different solutions have been proposed [1,2,3]. This problem has several lines of application in research, such as time windows networks, logistics, and more [4]. R is a free- software environment for statistical computing and graphics, and its potential depends on the packages contributed to the project by the community; however no R packages includes the SPPFP.
Sociedad Argentina de Informática e Investigación Operativa - Materia
-
Ciencias Informáticas
Rpackage
shortest path
forbidden paths
network flows - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-sa/3.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/72546
Ver los metadatos del registro completo
| id |
SEDICI_e28c89ae709661b4dc2bfd7796c12732 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/72546 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
Towards an R Package for the Shortest Path Problem with Forbidden PathsVidoni, Melina C.Vecchietti, Aldo R.Ciencias InformáticasRpackageshortest pathforbidden pathsnetwork flowsThe shortest path problem with forbidden paths (SPPFP) is a variant of the original shortest path problem. Given a directed graph = (, ), there is also a related set of known forbidden sub-paths in . The problem is to find the shortest paths from a source to a destination node, with no paths in the solution contain forbidden sub-path. SPPFP has been addressed in the academic literature, and different solutions have been proposed [1,2,3]. This problem has several lines of application in research, such as time windows networks, logistics, and more [4]. R is a free- software environment for statistical computing and graphics, and its potential depends on the packages contributed to the project by the community; however no R packages includes the SPPFP.Sociedad Argentina de Informática e Investigación Operativa2018-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionResumenhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf57-58http://sedici.unlp.edu.ar/handle/10915/72546enginfo:eu-repo/semantics/altIdentifier/url/http://47jaiio.sadio.org.ar/sites/default/files/LatinR_32.pdfinfo:eu-repo/semantics/altIdentifier/issn/2618-3196info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-sa/3.0/Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:43:59Zoai:sedici.unlp.edu.ar:10915/72546Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:43:59.515SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
Towards an R Package for the Shortest Path Problem with Forbidden Paths |
| title |
Towards an R Package for the Shortest Path Problem with Forbidden Paths |
| spellingShingle |
Towards an R Package for the Shortest Path Problem with Forbidden Paths Vidoni, Melina C. Ciencias Informáticas Rpackage shortest path forbidden paths network flows |
| title_short |
Towards an R Package for the Shortest Path Problem with Forbidden Paths |
| title_full |
Towards an R Package for the Shortest Path Problem with Forbidden Paths |
| title_fullStr |
Towards an R Package for the Shortest Path Problem with Forbidden Paths |
| title_full_unstemmed |
Towards an R Package for the Shortest Path Problem with Forbidden Paths |
| title_sort |
Towards an R Package for the Shortest Path Problem with Forbidden Paths |
| dc.creator.none.fl_str_mv |
Vidoni, Melina C. Vecchietti, Aldo R. |
| author |
Vidoni, Melina C. |
| author_facet |
Vidoni, Melina C. Vecchietti, Aldo R. |
| author_role |
author |
| author2 |
Vecchietti, Aldo R. |
| author2_role |
author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas Rpackage shortest path forbidden paths network flows |
| topic |
Ciencias Informáticas Rpackage shortest path forbidden paths network flows |
| dc.description.none.fl_txt_mv |
The shortest path problem with forbidden paths (SPPFP) is a variant of the original shortest path problem. Given a directed graph = (, ), there is also a related set of known forbidden sub-paths in . The problem is to find the shortest paths from a source to a destination node, with no paths in the solution contain forbidden sub-path. SPPFP has been addressed in the academic literature, and different solutions have been proposed [1,2,3]. This problem has several lines of application in research, such as time windows networks, logistics, and more [4]. R is a free- software environment for statistical computing and graphics, and its potential depends on the packages contributed to the project by the community; however no R packages includes the SPPFP. Sociedad Argentina de Informática e Investigación Operativa |
| description |
The shortest path problem with forbidden paths (SPPFP) is a variant of the original shortest path problem. Given a directed graph = (, ), there is also a related set of known forbidden sub-paths in . The problem is to find the shortest paths from a source to a destination node, with no paths in the solution contain forbidden sub-path. SPPFP has been addressed in the academic literature, and different solutions have been proposed [1,2,3]. This problem has several lines of application in research, such as time windows networks, logistics, and more [4]. R is a free- software environment for statistical computing and graphics, and its potential depends on the packages contributed to the project by the community; however no R packages includes the SPPFP. |
| publishDate |
2018 |
| dc.date.none.fl_str_mv |
2018-09 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Resumen http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/72546 |
| url |
http://sedici.unlp.edu.ar/handle/10915/72546 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://47jaiio.sadio.org.ar/sites/default/files/LatinR_32.pdf info:eu-repo/semantics/altIdentifier/issn/2618-3196 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-sa/3.0/ Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-sa/3.0/ Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) |
| dc.format.none.fl_str_mv |
application/pdf 57-58 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1842260311844847616 |
| score |
13.13397 |