Towards an R Package for the Shortest Path Problem with Forbidden Paths

ALDO VECCHIETTI; MELINA VIDONI

Ciudad de Buenos Aires

Conferencia; Latinamerican Conference About the Use of R in R&D; 2018

Universidad de Palermo

[El artículo es un Short Abstract. Se muestra la introducción.] The shortest path problem with forbidden paths (SPPFP) is a variant of the original shortest path problem. Given a directed graph G=(N,A), there is also a related set F of known forbidden sub-paths in G. 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.