Finding the most navigable path in road networks

Abstract

Input to the Most Navigable Path (MNP) problem consists of the following: (a) a road network represented as a directed graph, where each edge is associated with numeric attributes of cost and “navigability score” values; (b) a source and a destination and; (c) a budget value which denotes the maximum permissible cost of the solution. Given the input, MNP aims to determine a path between the source and the destination which maximizes the navigability score while constraining its cost to be within the given budget value. The problem can be modeled as the arc orienteering problem which is known to be NP-hard. The current state-of-the-art for this problem may generate paths having loops, and its adaptation for MNP that yields simple paths, was found to be inefficient. In this paper, we propose five novel algorithms for the MNP problem. Our algorithms first compute a seed path from the source to the destination, and then modify the seed path to improve its navigability. We explore two approaches to compute the seed path. For modification of the seed path, we explore different Dynamic Programming based approaches. We also propose an indexing structure for the MNP problem which helps in reducing the running time of some of our algorithms. Our experimental results indicate that the proposed solutions yield comparable or better solutions while being orders of magnitude faster than the current state-of-the-art for large real road networks.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24

Notes

  1. 1.

    If the edge costs represent travel-times, then a lower bound on the travel time may be used. This can be computed using the upper speed limit of a road segment.

  2. 2.

    best-successor in case of forward and best-predecessor in case of backward.

  3. 3.

    If edge costs represent travel-times, then the travel-time based budget can be converted to a distance based budget using the upper speed limit of a road segment.

  4. 4.

    https://www.openstreetmap.org

  5. 5.

    https://www.cs.utah.edu/~lifeifei/SpatialDataset.htm

  6. 6.

    http://users.diag.uniroma1.it/challenge9/download.shtml

References

  1. 1.

    Archetti C, Corberán A, Plana I, Sanchis JM, Speranza MG (2016) A branch-and-cut algorithm for the orienteering arc routing problem. Comput Oper Res 66(C):95–104

    Article  Google Scholar 

  2. 2.

    Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G, Vathis N (2015) Approximation algorithms for the arc orienteering problem. Inf Process Lett 115(2):313–315

    Article  Google Scholar 

  3. 3.

    Vansteenwegen P, Souffriau W, Oudheusden DV (2011) The orienteering problem: A survey. Eur J Oper Res 209(1):1–10. https://doi.org/10.1016/j.ejor.2010.03.045

    Article  Google Scholar 

  4. 4.

    Golden B L, Levy L, Vohra R (1987) The orienteering problem. Naval Res Logist (NRL) 34(3):307–318

    Article  Google Scholar 

  5. 5.

    Laporte G, Martello S (1990) The selective travelling salesman problem. Discret Appl Math 26(2):193–207

    Article  Google Scholar 

  6. 6.

    Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G (2014) A survey on algorithmic approaches for solving tourist trip design problems. J Heuristics 20(3):291–328

    Article  Google Scholar 

  7. 7.

    Ford LRJ (1956) Network flow theory. Technical Report P-923

  8. 8.

    Floyd R W (1962) Algorithm 97: Shortest path. Commun ACM 5 (6):345. https://doi.org/10.1145/367766.368168

    Article  Google Scholar 

  9. 9.

    Dijkstra E W (1959) A note on two problems in connexion with graphs. Numer Math 1(1). https://doi.org/10.1007/BF01386390

  10. 10.

    Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4 (2):100–107

    Article  Google Scholar 

  11. 11.

    Martins E, Pascoal M (2003) A new implementation of yen’s ranking loopless paths algorithm. Quart J Belgian, French Italian Oper Res Soc 1(2):121–133

    Google Scholar 

  12. 12.

    Yen J Y (1971) Finding the k shortest loopless paths in a network. Manag Sci 17(11):712–716

    Article  Google Scholar 

  13. 13.

    Hershberger J, Maxel M, Suri S (2007) Finding the k shortest simple paths: A new algorithm and its implementation. ACM Trans Algorithms 3(4)

  14. 14.

    Kriegel H-P, Renz M, Schubert M (2010) Route skyline queries: A multi-preference path planning approach. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp 261– 272

  15. 15.

    Tian Y, Lee K C K, Lee W-C (2009) Finding skyline paths in road networks. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS ’09. https://doi.org/10.1145/1653771.1653840. ACM, New York, pp 444–447

  16. 16.

    Fischetti M, Salazar González J J, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS J Comput 10:133–148

    Article  Google Scholar 

  17. 17.

    Souffriau W, Vansteenwegen P, Berghe G V, Oudheusden D V (2011) The planning of cycle trips in the province of east flanders. Omega 39 (2):209–213

    Article  Google Scholar 

  18. 18.

    Verbeeck C, Vansteenwegen P, Aghezzaf E-H (2014) An extension of the arc orienteering problem and its application to cycle trip planning. Transp Res Part E: Logist Transp Rev 68:64–78

    Article  Google Scholar 

  19. 19.

    Bolzoni P, Persia F, Helmer S (2017) Itinerary planning with category constraints using a probabilistic approach. In: Database and Expert Systems Applications. Springer International Publishing, pp 363–377

  20. 20.

    Singh A, Krause A, Guestrin C, Kaiser W, Batalin M (2007) Efficient planning of informative paths for multiple robots. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI’07, pp 2204–2211

  21. 21.

    Lu Y, Shahabi C (2015) An arc orienteering algorithm to find the most scenic path on a large-scale road network. In: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL ’15, pp 46:1–46:10

  22. 22.

    Bolzoni P, Helmer S (2017) Hybrid best-first greedy search for orienteering with category constraints. In: Proceedings of SSTD 2017, pp 24–42

  23. 23.

    Chekuri C, Pal M (2005) A recursive greedy algorithm for walks in directed graphs. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS ’05, pp 245–253

  24. 24.

    Nagarajan V, Ravi R (2011) The directed orienteering problem. Algorithmica 60(4):1017–1030

    Article  Google Scholar 

  25. 25.

    Nagarajan V, Ravi R (2007) Poly-logarithmic approximation algorithms for directed vehicle routing problems. In: Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX ’07/RANDOM ’07, pp 257–270

  26. 26.

    Bansal N, Blum A, Chawla S, Meyerson A (2004) Approximation algorithms for deadline-tsp and vehicle routing with time-windows. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, STOC ’04, pp 166–174

  27. 27.

    Kaur R, Goyal V, Gunturi V M V (2018) Finding the most navigable path in road networks: A summary of results. Database and Expert Systems Applications, pp 440–456

  28. 28.

    Aly A M, Mahmood A R, Hassan M S, Aref W G, Ouzzani M, Elmeleegy H, Qadah T (2015) Aqwa: Adaptive query workload aware partitioning of big spatial data. Proc VLDB Endow 8(13):2062–2073

    Article  Google Scholar 

Download references

Acknowledgements

This work was in part supported by the Infosys Centre for Artificial Intelligence at IIIT-Delhi, Visvesvaraya Ph.D. Scheme for Electronics and IT, and DST SERB(ECR/2016/001053).

Author information

Affiliations

Authors

Corresponding author

Correspondence to Ramneek Kaur.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Kaur, R., Goyal, V. & Gunturi, V.M.V. Finding the most navigable path in road networks. Geoinformatica 25, 207–240 (2021). https://doi.org/10.1007/s10707-020-00428-5

Download citation

Keywords

  • Spatial networks
  • Road networks
  • Routing