Abstract
Alternatives to the shortest path are a standard feature of modern navigation services where more than one suitable paths between source and destination are presented to the users so that they can use a path of their choice for navigation. Although there exist several approaches to compute top-k alternative paths, these techniques define suitable paths differently, hence, the top-k alternative routes generated by these techniques may be different. Unfortunately, there is no work that quantifies or experimentally compares the quality of the alternative routes generated by these techniques. This demonstration visualises the top-k alternative routes generated by two state-of-the-art techniques as well as the routes provided by Google Maps. The visualisation makes it easy for the users of the demonstration to compare the quality of the routes generated by each technique. The source code of the demonstration is also made publicly available which makes it easy to incorporate results by other techniques and mapping services and thus compare routes provided by these.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abeywickrama, T., Cheema, M.A., Taniar, D.: K-nearest neighbors on road networks: a journey in experimentation and in-memory implementation. Proc. VLDB Endow. 9(6), 492–503 (2016)
Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Alternative routes in road networks. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 23–34. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13193-6_3
Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U.: Exact and approximate algorithms for finding k-shortest paths with limited overlap. In: EDxBT, pp. 414–425 (2017)
Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)
Cambridge Vehicle Information Technology Ltd., Choice Routing (2005). http://www.camvit.com
Acknowledgements
Muhammad Aamir Cheema is supported by DP180103411.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Li, L., Cheema, M.A., Taniar, D., Indrawan-Santiago, M. (2018). Visualising Top-k Alternative Routes. In: Wang, J., Cong, G., Chen, J., Qi, J. (eds) Databases Theory and Applications. ADC 2018. Lecture Notes in Computer Science(), vol 10837. Springer, Cham. https://doi.org/10.1007/978-3-319-92013-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-92013-9_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-92012-2
Online ISBN: 978-3-319-92013-9
eBook Packages: Computer ScienceComputer Science (R0)