Skip to main content

Visualising Top-k Alternative Routes

  • Conference paper
  • First Online:
Databases Theory and Applications (ADC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10837))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://github.com/lingxiao29/VisualisingTop-kAlternativeRoutes.

  2. 2.

    https://spring.io/.

  3. 3.

    https://developers.google.com/maps/documentation/.

  4. 4.

    http://www.dis.uniroma1.it/challenge9/download.shtml.

  5. 5.

    https://developers.google.com/maps/documentation/javascript/directions.

References

  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)

    Article  Google Scholar 

  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_3

    Chapter  Google Scholar 

  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. Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)

    Article  MathSciNet  Google Scholar 

  5. Cambridge Vehicle Information Technology Ltd., Choice Routing (2005). http://www.camvit.com

Download references

Acknowledgements

Muhammad Aamir Cheema is supported by DP180103411.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lingxiao Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics