Software Open Access
melvidoni/rsppfp: R-SPPFP v1.0.0.0
Melina Vidoni;
Aldo Vecchietti
The R-SPPFP package implements different algorithms for transforming graphs in the Shortest Path Problem with Forbidden Paths (SPPFP). This problem is an important concept in the field of graph theories, and it is a variant of the traditional shortest path problem. In here, there is an additional constrait that takes the form of a finite set of forbidden paths (arc sequences of at least three nodes) that cannot be part of any solution path.
Version 1.0.0.0
First stable release of advanced implementation of R-SPPFP! Includes the following functions:
- Transformation algorithms (Villeneuve & Desaulniers, and Hsu's et al.).
- Basic parsin functions: graph-to-digraph, and vpath translation.
- Integration functions: equivalent nodes selection, and igraph's integration.
| Name | Size | |
|---|---|---|
|
melvidoni/rsppfp-1.0.0.0.zip
md5:dead7591d8d00d5971d18bce689c9922 |
345.9 kB | Download |
C.-C. Hsu, D.-R. Chen, and H.-Y. Ding, "An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths," in Inter-national Conference on Algorithms and Architectures for Parallel Processing, vol. LNCS 5574, Taipei, Taiwan, 2009, pp. 638-650, https://doi.org/10.1007/978-3-642-03095-6_60.
D. Villeneuve and G. Desaulniers, "The shortest path problem with forbidden paths," European Journal of Operational Research, vol. 165, no. 1, pp. 97-107, 2005, https://doi.org/10.1016/j.ejor.2004.01.032.
| All versions | This version | |
|---|---|---|
| Views | 39 | 26 |
| Downloads | 17 | 6 |
| Data volume | 6.3 MB | 2.1 MB |
| Unique views | 34 | 23 |
| Unique downloads | 12 | 5 |
Indexed in
- Publication date:
- September 10, 2018
- DOI:
-
- Keyword(s):
- shortest path problem shortest path problem with forbidden paths R graph theory
- Related identifiers:
- Supplement to
- License (for files):
- GNU General Public License v3.0 only