Abstract
This paper focuses on developing methods to reconstruct the physical path of underground infrastructure networks. These reconstructions are based on the structure of the network, start and endpoints and the structure of an underlying network. This data is partly considered unreliable or uncertain. Two methods are presented to realise the reconstruction. The first method finds a path of given length in a directed graph by applying a modified version of Yen’s algorithm for finding K-shortest simple paths in a directed graph. A second, so-called Bottom-up approach is developed which aims to take advantage of the structure of the underlying network. The developed methods are applied on a series of examples for comparison.
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
Aljazzar, H., Leue, S.: K\(^*\): a heuristic search algorithm for finding the \(k\) shortest paths. Artif. Intell. 175, 2129–2154 (2011). Elsevier
Bellman, R., Kalaba, R.: On kth best policies. J. Soc. Ind. Appl. Math. 8(4), 582–588 (1960)
Eppstein, D.: Finding the k shortest paths. In: 1994 Proceedings of 35th Annual Symposium on Foundations of Computer Science, pp. 154–165. IEEE (1994)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)
Hershberger, J., Maxel, M., Suri, S.: Finding the k shortest simple paths: a new algorithm and its implementation. ACM Trans. Algorithms (TALG) 3(4), 45 (2007)
Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, pp. 252–259. IEEE (2001)
Hoffman, W., Pavley, R.: A method for the solution of the nth best path problem. J. ACM (JACM) 6(4), 506–514 (1959)
Jiménez, V.M., Marzal, A.: Computing the K shortest paths: a new algorithm and an experimental comparison. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 15–29. Springer, Heidelberg (1999). doi:10.1007/3-540-48318-7_4
Jiménez, V.M., Marzal, A.: A lazy version of Eppstein’s K shortest paths algorithm. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol. 2647, pp. 179–191. Springer, Heidelberg (2003). doi:10.1007/3-540-44867-5_14
Neumann, N., Phillipson, F.: Connecting points to a set of line segments in infrastructure design problems. In: 21st European Conference on Networks and Optical Communications (NOC 2016), Lisbon, Portugal (2016)
Nykänen, M., Ukkonen, E.: The exact path length problem. J. Algorithms 42(1), 41–53 (2002)
Phillipson, F.: Efficient algorithms for infrastructure networks: planning issues and economic impact. Ph.D. thesis, VU Amsterdam (2014)
Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (1971)
Acknowledgments
The authors like to thank Niels Neumann for his helpful comments and discussion.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
de Koning, M., Phillipson, F. (2016). Reconstruct Underground Infrastructure Networks Based on Uncertain Information. In: Fahrnberger, G., Eichler, G., Erfurth, C. (eds) Innovations for Community Services. I4CS 2016. Communications in Computer and Information Science, vol 648. Springer, Cham. https://doi.org/10.1007/978-3-319-49466-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-49466-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49465-4
Online ISBN: 978-3-319-49466-1
eBook Packages: Computer ScienceComputer Science (R0)