Advertisement

Visualising Top-k Alternative Routes

  • Lingxiao Li
  • Muhammad Aamir Cheema
  • David Taniar
  • Maria Indrawan-Santiago
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10837)

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.

Keywords

Shortest paths Route planning Alternative paths 

Notes

Acknowledgements

Muhammad Aamir Cheema is supported by DP180103411.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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_3CrossRefGoogle Scholar
  3. 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)Google Scholar
  4. 4.
    Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Cambridge Vehicle Information Technology Ltd., Choice Routing (2005). http://www.camvit.com

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Lingxiao Li
    • 1
  • Muhammad Aamir Cheema
    • 1
  • David Taniar
    • 1
  • Maria Indrawan-Santiago
    • 1
  1. 1.Monash UniversityMelbourneAustralia

Personalised recommendations