{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:13:48Z","timestamp":1781086428291,"version":"3.54.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["ECR\/2016\/001053"],"award-info":[{"award-number":["ECR\/2016\/001053"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10707-020-00428-5","type":"journal-article","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T11:02:15Z","timestamp":1609671735000},"page":"207-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Finding the most navigable path in road networks"],"prefix":"10.1007","volume":"25","author":[{"given":"Ramneek","family":"Kaur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vikram","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Venkata M. V.","family":"Gunturi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,3]]},"reference":[{"issue":"C","key":"428_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.cor.2015.08.003","volume":"66","author":"C Archetti","year":"2016","unstructured":"Archetti C, Corber\u00e1n 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\u2013104","journal-title":"Comput Oper Res"},{"issue":"2","key":"428_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ipl.2014.10.003","volume":"115","author":"D Gavalas","year":"2015","unstructured":"Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G, Vathis N (2015) Approximation algorithms for the arc orienteering problem. Inf Process Lett 115(2):313\u2013315","journal-title":"Inf Process Lett"},{"issue":"1","key":"428_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen P, Souffriau W, Oudheusden DV (2011) The orienteering problem: A survey. Eur J Oper Res 209(1):1\u201310. https:\/\/doi.org\/10.1016\/j.ejor.2010.03.045","journal-title":"Eur J Oper Res"},{"issue":"3","key":"428_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden B L, Levy L, Vohra R (1987) The orienteering problem. Naval Res Logist (NRL) 34(3):307\u2013318","journal-title":"Naval Res Logist (NRL)"},{"issue":"2","key":"428_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte G, Martello S (1990) The selective travelling salesman problem. Discret Appl Math 26(2):193\u2013207","journal-title":"Discret Appl Math"},{"issue":"3","key":"428_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","volume":"20","author":"D Gavalas","year":"2014","unstructured":"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\u2013328","journal-title":"J Heuristics"},{"key":"428_CR7","unstructured":"Ford LRJ (1956) Network flow theory. Technical Report P-923"},{"issue":"6","key":"428_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd R W (1962) Algorithm 97: Shortest path. Commun ACM 5 (6):345. https:\/\/doi.org\/10.1145\/367766.368168","journal-title":"Commun ACM"},{"key":"428_CR9","doi-asserted-by":"publisher","unstructured":"Dijkstra E W (1959) A note on two problems in connexion with graphs. Numer Math 1(1). https:\/\/doi.org\/10.1007\/BF01386390","DOI":"10.1007\/BF01386390"},{"issue":"2","key":"428_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"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\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"issue":"2","key":"428_CR11","first-page":"121","volume":"1","author":"E Martins","year":"2003","unstructured":"Martins E, Pascoal M (2003) A new implementation of yen\u2019s ranking loopless paths algorithm. Quart J Belgian, French Italian Oper Res Soc 1(2):121\u2013133","journal-title":"Quart J Belgian, French Italian Oper Res Soc"},{"issue":"11","key":"428_CR12","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen J Y (1971) Finding the k shortest loopless paths in a network. Manag Sci 17(11):712\u2013716","journal-title":"Manag Sci"},{"key":"428_CR13","doi-asserted-by":"crossref","unstructured":"Hershberger J, Maxel M, Suri S (2007) Finding the k shortest simple paths: A new algorithm and its implementation. ACM Trans Algorithms 3(4)","DOI":"10.1145\/1290672.1290682"},{"key":"428_CR14","unstructured":"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\u2013 272"},{"key":"428_CR15","doi-asserted-by":"publisher","unstructured":"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 \u201909. https:\/\/doi.org\/10.1145\/1653771.1653840. ACM, New York, pp 444\u2013447","DOI":"10.1145\/1653771.1653840"},{"key":"428_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti M, Salazar Gonz\u00e1lez J J, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS J Comput 10:133\u2013148","journal-title":"INFORMS J Comput"},{"issue":"2","key":"428_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2010.05.001","volume":"39","author":"W Souffriau","year":"2011","unstructured":"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\u2013213","journal-title":"Omega"},{"key":"428_CR18","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tre.2014.05.006","volume":"68","author":"C Verbeeck","year":"2014","unstructured":"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\u201378","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"428_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013377","DOI":"10.1007\/978-3-319-64471-4_29"},{"key":"428_CR20","unstructured":"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\u201907, pp 2204\u20132211"},{"key":"428_CR21","doi-asserted-by":"crossref","unstructured":"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 \u201915, pp 46:1\u201346:10","DOI":"10.1145\/2820783.2820835"},{"key":"428_CR22","doi-asserted-by":"crossref","unstructured":"Bolzoni P, Helmer S (2017) Hybrid best-first greedy search for orienteering with category constraints. In: Proceedings of SSTD 2017, pp 24\u201342","DOI":"10.1007\/978-3-319-64367-0_2"},{"key":"428_CR23","doi-asserted-by":"crossref","unstructured":"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 \u201905, pp 245\u2013253","DOI":"10.1109\/SFCS.2005.9"},{"issue":"4","key":"428_CR24","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s00453-011-9509-2","volume":"60","author":"V Nagarajan","year":"2011","unstructured":"Nagarajan V, Ravi R (2011) The directed orienteering problem. Algorithmica 60(4):1017\u20131030","journal-title":"Algorithmica"},{"key":"428_CR25","doi-asserted-by":"crossref","unstructured":"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 \u201907\/RANDOM \u201907, pp 257\u2013270","DOI":"10.1007\/978-3-540-74208-1_19"},{"key":"428_CR26","doi-asserted-by":"crossref","unstructured":"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 \u201904, pp 166\u2013174","DOI":"10.1145\/1007352.1007385"},{"key":"428_CR27","doi-asserted-by":"crossref","unstructured":"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\u2013456","DOI":"10.1007\/978-3-319-98809-2_27"},{"issue":"13","key":"428_CR28","doi-asserted-by":"publisher","first-page":"2062","DOI":"10.14778\/2831360.2831361","volume":"8","author":"AM Aly","year":"2015","unstructured":"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\u20132073","journal-title":"Proc VLDB Endow"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-020-00428-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-020-00428-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-020-00428-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T05:11:24Z","timestamp":1611033084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-020-00428-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["428"],"URL":"https:\/\/doi.org\/10.1007\/s10707-020-00428-5","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"16 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}