Towards an R Package for the Shortest Path Problem with Forbidden Paths
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...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia Resumen |
| Lenguaje: | Inglés |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/72546 http://47jaiio.sadio.org.ar/sites/default/files/LatinR_32.pdf |
| Aporte de: |
| Sumario: | 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. |
|---|