{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T03:47:21Z","timestamp":1782100041168,"version":"3.54.5"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T00:00:00Z","timestamp":1779494400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T00:00:00Z","timestamp":1779494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10707-026-00577-z","type":"journal-article","created":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T01:38:51Z","timestamp":1779500331000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A parallelizable algorithm for constrained maximization of preferences in large time-dependent graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Kousik Kumar","family":"Dutta","sequence":"first","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":[[2026,5,23]]},"reference":[{"key":"577_CR1","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/2820783.2820835","DOI":"10.1145\/2820783.2820835"},{"key":"577_CR2","doi-asserted-by":"publisher","unstructured":"Lu Y, Joss\u00e9 G, Emrich T, Demiryurek U, Renz M, Shahabi C, Schubert M (2017) Scenic routes now: Efficiently solving the time-dependent arc orienteering problem. In: Proceedings of the 2017 ACM on conference on information and knowledge management, pp 487\u2013496. https:\/\/doi.org\/10.1145\/3132847.3132874","DOI":"10.1145\/3132847.3132874"},{"issue":"2","key":"577_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s11704-019-8364-1","volume":"14","author":"C Chen","year":"2019","unstructured":"Chen C, Gao L, Xie X, Wang Z (2019) Enjoy the most beautiful scene now: a memetic algorithm to solve two-fold time-dependent arc orienteering problem. Front Comp Sci 14(2):364\u2013377. https:\/\/doi.org\/10.1007\/s11704-019-8364-1","journal-title":"Front Comp Sci"},{"key":"577_CR4","doi-asserted-by":"publisher","unstructured":"Dutta KK, Dewan A, Gunturi VMV (2022) A multi-threading algorithm for constrained path optimization problem on road networks. In: Web Information Systems Engineering \u2013 WISE 2022, pp 110\u2013118. https:\/\/doi.org\/10.1007\/978-3-031-20891-1_9","DOI":"10.1007\/978-3-031-20891-1_9"},{"issue":"1","key":"577_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10707-020-00428-5","volume":"25","author":"R Kaur","year":"2021","unstructured":"Kaur R, Goyal V, Gunturi VMV (2021) Finding the most navigable path in road networks. GeoInformatica 25(1):207\u2013240. https:\/\/doi.org\/10.1007\/s10707-020-00428-5","journal-title":"GeoInformatica"},{"key":"577_CR6","doi-asserted-by":"publisher","unstructured":"Das A, Schneider NR, Samet H (2024) Safety-aware route navigation: Driving with less sun glare. In: Proceedings of the 32nd ACM international conference on advances in geographic information systems. SIGSPATIAL \u201924, pp 497\u2013500. https:\/\/doi.org\/10.1145\/3678717.3691225","DOI":"10.1145\/3678717.3691225"},{"key":"577_CR7","doi-asserted-by":"publisher","unstructured":"Aljubayrin S, Qi J, Jensen CS, Zhang R, He Z, Wen Z (2015) The safest path via safe zones. In: 2015 IEEE 31st international conference on data engineering, pp 531\u2013542. https:\/\/doi.org\/10.1109\/ICDE.2015.7113312","DOI":"10.1109\/ICDE.2015.7113312"},{"issue":"11","key":"577_CR8","doi-asserted-by":"publisher","first-page":"10922","DOI":"10.1109\/TKDE.2023.3234703","volume":"35","author":"FT Islam","year":"2023","unstructured":"Islam FT, Hashem T, Shahriyar R (2023) A crowd-enabled approach for privacy-enhanced and personalized safe route planning for fixed or flexible destinations. IEEE Trans Knowl Data Eng 35(11):10922\u201310936. https:\/\/doi.org\/10.1109\/TKDE.2023.3234703","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"577_CR9","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. https:\/\/doi.org\/10.1016\/j.ipl.2014.10.003","journal-title":"Inf Process Lett"},{"key":"577_CR10","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. Trans Res Part E Logis Trans Rev 68:64\u201378. https:\/\/doi.org\/10.1016\/j.tre.2014.05.006","journal-title":"Trans Res Part E Logis Trans Rev"},{"key":"577_CR11","doi-asserted-by":"publisher","unstructured":"Demiryurek U, Banaei-Kashani F, Shahabi C, Ranganathan A (2011) Online computation of fastest path in time-dependent spatial networks. In: Advances in spatial and temporal databases, pp 92\u2013111. https:\/\/doi.org\/10.1007\/978-3-642-22922-0_7","DOI":"10.1007\/978-3-642-22922-0_7"},{"key":"577_CR12","unstructured":"Department for Transport, UK (2025) The Highway Code - Waiting and Parking (Rules 238 to 252). https:\/\/www.gov.uk\/guidance\/the-highway-code\/waiting-and-parking-238-to-252. Accessed 03 April 2025"},{"key":"577_CR13","doi-asserted-by":"publisher","unstructured":"Gao L, Chen C, Huang H, Xiang C (2019) A memetic algorithm for finding the two-fold time-dependent most beautiful driving routes. In: 2019 IEEE Wireless Communications and Networking Conference (WCNC), pp 1\u20136. https:\/\/doi.org\/10.1109\/WCNC.2019.8886336","DOI":"10.1109\/WCNC.2019.8886336"},{"key":"577_CR14","doi-asserted-by":"publisher","unstructured":"Dutta KK, Gunturi VMV (2024) Constrain path optimization on time-dependent road networks. In: Web Information Systems Engineering \u2013 WISE 2024 PhD Symposium, Demos and Workshops. https:\/\/doi.org\/10.1007\/978-981-96-1483-7","DOI":"10.1007\/978-981-96-1483-7"},{"issue":"3","key":"577_CR15","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/69.687976","volume":"10","author":"N Jing","year":"1998","unstructured":"Jing N, Huang Y-W, Rundensteiner EA (1998) Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Trans Knowl Data Eng 10(3):409\u2013432. https:\/\/doi.org\/10.1109\/69.687976","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"577_CR16","doi-asserted-by":"publisher","first-page":"2458","DOI":"10.1109\/TKDE.2020.3010005","volume":"34","author":"M Zhang","year":"2022","unstructured":"Zhang M, Li L, Hua W, Zhou X (2022) Stream processing of shortest path query in dynamic road networks. IEEE Trans Knowl Data Eng 34(5):2458\u20132471. https:\/\/doi.org\/10.1109\/TKDE.2020.3010005","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"577_CR17","doi-asserted-by":"publisher","unstructured":"Sankaranarayanan J, Alborzi H, Samet H (2005) Efficient query processing on spatial networks. In: Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems. GIS \u201905, pp 200\u2013209. https:\/\/doi.org\/10.1145\/1097064.1097093","DOI":"10.1145\/1097064.1097093"},{"key":"577_CR18","doi-asserted-by":"publisher","unstructured":"Akiba T, Iwata Y, Yoshida Y (2013) Fast exact shortest-path distance queries on large networks by pruned landmark labeling. SIGMOD \u201913, pp 349\u2013360. https:\/\/doi.org\/10.1145\/2463676.2465315","DOI":"10.1145\/2463676.2465315"},{"issue":"1","key":"577_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271. https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer Math"},{"issue":"7","key":"577_CR20","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jpdc.2012.02.007","volume":"73","author":"D Delling","year":"2013","unstructured":"Delling D, Goldberg AV, Nowatzyk A, Werneck RF (2013) Phast: Hardware-accelerated shortest path trees. J Parallel Distrib Comput 73(7):940\u2013952. https:\/\/doi.org\/10.1016\/j.jpdc.2012.02.007","journal-title":"J Parallel Distrib Comput"},{"key":"577_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67771-2","author":"VMV Gunturi","year":"2017","unstructured":"Gunturi VMV, Shekhar S (2017). Spatio-Temporal Graph Data Analytics. https:\/\/doi.org\/10.1007\/978-3-319-67771-2","journal-title":"Spatio-Temporal Graph Data Analytics"},{"issue":"10","key":"577_CR22","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.1109\/TKDE.2015.2426701","volume":"27","author":"VMV Gunturi","year":"2015","unstructured":"Gunturi VMV, Shekhar S, Yang K (2015) A critical-time-point approach to all-departure-time lagrangian shortest paths. IEEE Trans Knowl Data Eng 27(10):2591\u20132603. https:\/\/doi.org\/10.1109\/TKDE.2015.2426701","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"577_CR23","doi-asserted-by":"publisher","unstructured":"Ding B, Yu JX, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology. EDBT \u201908, pp 205\u2013216. https:\/\/doi.org\/10.1145\/1353343.1353371","DOI":"10.1145\/1353343.1353371"},{"key":"577_CR24","doi-asserted-by":"publisher","unstructured":"Li L, Hua W, Du X, Zhou X (2017) Minimal on-road time route scheduling on time-dependent graphs. Proc VLDB Endow 10(11):1274\u20131285. https:\/\/doi.org\/10.14778\/3137628.3137638","DOI":"10.14778\/3137628.3137638"},{"key":"577_CR25","doi-asserted-by":"publisher","unstructured":"Vishwakarma K, Gunturi VMV (2020) Impromptu rendezvous based multi-threaded algorithm for shortest lagrangian path problem on road networks. In: Algorithms and architectures for parallel processing, pp 201\u2013222. https:\/\/doi.org\/10.1007\/978-3-030-38991-8_14","DOI":"10.1007\/978-3-030-38991-8_14"},{"issue":"3","key":"577_CR26","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke KL, Halsey E (1966) The shortest route through a network with time-dependent internodal transit times. J Math Anal Appl 14(3):493\u2013498. https:\/\/doi.org\/10.1016\/0022-247X(66)90009-6","journal-title":"J Math Anal Appl"},{"key":"577_CR27","doi-asserted-by":"publisher","unstructured":"Wu H, Cheng J, Huang S, Ke Y, Lu Y, Xu Y (2014) Path problems in temporal graphs. Proc VLDB Endow 7(9):721\u2013732. https:\/\/doi.org\/10.14778\/2732939.2732945","DOI":"10.14778\/2732939.2732945"},{"key":"577_CR28","doi-asserted-by":"publisher","unstructured":"Wang S, Lin W, Yang Y, Xiao X, Zhou S (2015) Efficient route planning on public transportation networks: A labelling approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data. SIGMOD \u201915, pp 967\u2013982. https:\/\/doi.org\/10.1145\/2723372.2749456","DOI":"10.1145\/2723372.2749456"},{"key":"577_CR29","doi-asserted-by":"publisher","unstructured":"Wu H, Huang Y, Cheng J, Li J, Ke Y (2016) Reachability and time-based path queries in temporal graphs. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp 145\u2013156. https:\/\/doi.org\/10.1109\/ICDE.2016.7498236","DOI":"10.1109\/ICDE.2016.7498236"},{"key":"577_CR30","doi-asserted-by":"publisher","unstructured":"Kaur R, Goyal V, Gunturi VMV (2018) Finding the most navigable path in road networks: A summary of results. In: Database and expert systems applications, pp 440\u2013456. https:\/\/doi.org\/10.1007\/978-3-319-98809-2_27","DOI":"10.1007\/978-3-319-98809-2_27"},{"key":"577_CR31","doi-asserted-by":"publisher","unstructured":"Wang L, Wong RC-W (2023) Qhl: A fast algorithm for exact constrained shortest path search on road networks. Proc ACM Manag Data 1(2). https:\/\/doi.org\/10.1145\/3589300","DOI":"10.1145\/3589300"},{"key":"577_CR32","doi-asserted-by":"publisher","unstructured":"Lu S, He B, Li Y, Fu H (2020) Accelerating exact constrained shortest paths on gpus. Proc VLDB Endow 14(4):547\u2013559 https:\/\/doi.org\/10.14778\/3436905.3436914","DOI":"10.14778\/3436905.3436914"},{"key":"577_CR33","doi-asserted-by":"publisher","unstructured":"Liu Z, Li L, Zhang M, Hua W, Chao P, Zhou X (2021) Efficient constrained shortest path query answering with forest hop labeling. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp 1763\u20131774. https:\/\/doi.org\/10.1109\/ICDE51399.2021.00155","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"577_CR34","doi-asserted-by":"publisher","unstructured":"Wang S, Xiao X, Yang Y, Lin W (2016) Effective indexing for approximate constrained shortest path queries on large road networks. Proc VLDB Endow 10(2):61\u201372. https:\/\/doi.org\/10.14778\/3015274.3015277","DOI":"10.14778\/3015274.3015277"},{"key":"577_CR35","doi-asserted-by":"publisher","unstructured":"Yuan Y et al (2019) Constrained shortest path query in a large time-dependent graph. Proc VLDB Endow 12(10):1058\u20131070. https:\/\/doi.org\/10.14778\/3339490.3339491","DOI":"10.14778\/3339490.3339491"},{"key":"577_CR36","doi-asserted-by":"publisher","unstructured":"Yuan Y, Lian X, Wang G, Chen L, Ma Y, Wang Y (2019) Weight-constrained route planning over time-dependent graphs. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp 914\u2013925. https:\/\/doi.org\/10.1109\/ICDE.2019.00086","DOI":"10.1109\/ICDE.2019.00086"},{"key":"577_CR37","doi-asserted-by":"publisher","unstructured":"Feillet D et al (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216\u2013229. https:\/\/doi.org\/10.1002\/net.20033","DOI":"10.1002\/net.20033"},{"key":"577_CR38","doi-asserted-by":"publisher","unstructured":"Zhang D, Tang H, Zhu C, Li Q (2025) Finding the maximum density path within constrained length in a graph. IEEE Trans Intell Trans Syst, pp 1\u201312. https:\/\/doi.org\/10.1109\/TITS.2025.3544252","DOI":"10.1109\/TITS.2025.3544252"},{"issue":"1","key":"577_CR39","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/TKDE.2024.3488095","volume":"37","author":"H Qian","year":"2025","unstructured":"Qian H, Zheng W, Zhang Z, Fu B (2025) Answering min-max resource-constrained shortest path queries over large graphs. IEEE Trans Knowl Data Eng 37(1):60\u201374. https:\/\/doi.org\/10.1109\/TKDE.2024.3488095","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"577_CR40","doi-asserted-by":"publisher","unstructured":"Wang Y, Yuan Y, Wang H, Zhou X, Mu C, Wang G (2021) Constrained route planning over large multi-modal time-dependent networks. In: Proc of the 37th IEEE ICDE, pp 313\u2013324. https:\/\/doi.org\/10.1109\/ICDE51399.2021.00034","DOI":"10.1109\/ICDE51399.2021.00034"},{"key":"577_CR41","doi-asserted-by":"publisher","unstructured":"Wang Y, Li G, Tang N (2019) Querying shortest paths on time dependent road networks. Proc VLDB Endow 12(11):1249\u20131261. https:\/\/doi.org\/10.14778\/3342263.3342265","DOI":"10.14778\/3342263.3342265"},{"key":"577_CR42","doi-asserted-by":"publisher","unstructured":"Gong Z, Zeng Y, Chen L (2024) Querying shortest path on large time-dependent road networks with shortcuts. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp 4532\u20134544. https:\/\/doi.org\/10.1109\/ICDE60146.2024.00345","DOI":"10.1109\/ICDE60146.2024.00345"},{"key":"577_CR43","doi-asserted-by":"crossref","unstructured":"Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng S-H (2005) On trip planning queries in spatial databases. In: Advances in spatial and temporal databases, pp 273\u2013290","DOI":"10.1007\/11535331_16"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-026-00577-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-026-00577-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-026-00577-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T02:51:58Z","timestamp":1782096718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-026-00577-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,23]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["577"],"URL":"https:\/\/doi.org\/10.1007\/s10707-026-00577-z","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,23]]},"assertion":[{"value":"30 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable. No funding was obtained for this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"Not applicable. This study does not involve human or animal participants.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable. This study does not involve human participants.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable. This study does not contain data from any individual person.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"19"}}