Abstract
This paper is concerned with the design and analysis of algorithms for the arc-dependent shortest path (ADSP) problem. A network is said to be arc-dependent if the cost of an arc a depends upon the arc taken to enter a. These networks are fundamentally different from traditional networks in which the cost associated with an arc is a fixed constant and part of the input. The ADSP problem is also known as the suffix-1 path-dependent shortest path problem in the literature. This problem has a polynomial time solution if the shortest paths are not required to be simple. The ADSP problem finds applications in a number of domains including highway engineering, turn penalties and prohibitions, and fare rebates. In this paper, we are interested in the ADSP problem when restricted to simple paths. We call this restricted version the simple arc-dependent shortest path (SADSP) problem. We show that the SADSP problem is NP-complete. We present inapproximability results and an exact exponential algorithm for this problem. Additionally, we explore the problem of detecting negative cost cycles in arc-dependent networks and discuss its algorithmic complexity.
K. Subramani—This research was supported in part by the Air-Force Office of Scientific Research through Grant FA9550-19-1-017. This research was also supported in part by the Air-Force Research Laboratory Rome through Contract FA8750-17-S-7007.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Añez, J., De La Barra, T., Pérez, B.: Dual graph representation of transport networks. Transp. Res. Part B: Methodol. 30(3), 209–216 (1996)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization and Their Approximability Properties, 1st edn. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-642-58412-1
Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)
Caldwell, T.: On finding minimum routes in a network with turn penalties. Commun. ACM 4(2), 107–108 (1961)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196–210 (1962)
Kirby, R.F., Potts, R.B.: The minimum route problem for networks with turn penalties and prohibitions. Transp. Res. 3(3), 397–408 (1969)
Orponen, P., Mannila, H.: On approximation preserving reductions: complete problems and robustmeasures. Technical report, Department of Computer Science, University of Helsinki (1987)
Tan, J.: On path-dependent shortest path and its application in finding least cost path in transportation networks. Master’s thesis, School of Computing, National University of Singapore (2003)
Tan, J., Leong, HW.: Least-cost path in public transportation systems with fare rebates that are path- and time-dependent. In: Proceedings of the 7th International IEEE Conference on Intelligent Transportation Systems (IEEE Cat. No. 04TH8749), pp. 1000–1005, October 2004
Ziliaskopoulos, A.K., Mahmassani, H.S.: A note on least time path computation considering delays and prohibitions for intersection movements. Transp. Res. Part B: Methodol. 30(5), 359–367 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Wojciechowski, P., Williamson, M., Subramani, K. (2020). On Finding Shortest Paths in Arc-Dependent Networks. In: Baïou, M., Gendron, B., Günlük, O., Mahjoub, A.R. (eds) Combinatorial Optimization. ISCO 2020. Lecture Notes in Computer Science(), vol 12176. Springer, Cham. https://doi.org/10.1007/978-3-030-53262-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-53262-8_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-53261-1
Online ISBN: 978-3-030-53262-8
eBook Packages: Computer ScienceComputer Science (R0)