{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:30:36Z","timestamp":1763458236216},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:00:00Z","timestamp":1685750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:00:00Z","timestamp":1685750400000},"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":[[2024,1]]},"DOI":"10.1007\/s10707-023-00497-2","type":"journal-article","created":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T09:02:32Z","timestamp":1685782952000},"page":"53-88","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Opportunistic package delivery as a service on road networks"],"prefix":"10.1007","volume":"28","author":[{"given":"Debajyoti","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jagan","family":"Sankaranarayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiran","family":"Khatter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanan","family":"Samet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"497_CR1","doi-asserted-by":"crossref","unstructured":"Abeywickrama T, Cheema MA, Taniar D (2016) k-nearest neighbors on road networks: a journey in experimentation and in memory implementation. In: Proceedings of the VLDB Endowment, vol 9(6), pp 492\u2013503","DOI":"10.14778\/2904121.2904125"},{"key":"497_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/223\/03131","volume":"223","author":"PK Agarwal","year":"1999","unstructured":"Agarwal PK, Erickson J (1999) Geometric range searching and its relatives. Advances in Discrete and Computational Geometry, Contemporary Mathematics 223:1\u201356","journal-title":"Advances in Discrete and Computational Geometry, Contemporary Mathematics"},{"key":"497_CR3","unstructured":"Ahuja R, Magnanti T, Orlin J (1993) Network Flows: Theory, Algorithms, and Applications, 1st edn. Pearson"},{"key":"497_CR4","doi-asserted-by":"crossref","unstructured":"Ali RY, Gunturi VM, Shekhar S, Eldawy A, Mokbel MF, Kotz AJ, Northrop WF (2015) Future connected vehicles: challenges and opportunities for spatio-temporal computing. In: Proceedings of the 23rd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, vol\u00a014, pp 1\u20134","DOI":"10.1145\/2820783.2820885"},{"issue":"2","key":"497_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TKDE.2003.1185836","volume":"15","author":"N An","year":"2003","unstructured":"An N, Jin J, Sivasubramaniam A (2003) Toward an accurate analysis of range queries on spatial data. IEEE Transactions on Knowledge and Data Engineering 15(2):305\u2013323","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"497_CR6","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10707-008-0055-2","volume":"13","author":"WD Bae","year":"2009","unstructured":"Bae WD, Alkobaisi S, Kim S, Narayanappa S, Shahabi C (2009) Supporting range queries on web data using k-nearest neighbour search. GeoInformatica 13(4):483\u2013514","journal-title":"GeoInformatica"},{"key":"497_CR7","doi-asserted-by":"crossref","unstructured":"Bao J, Chow CY, Mokbel MF, Ku WS (2010) Efficient evaluation of k-range nearest neighbor queries in road networks. In: Proceedings of the Eleventh International Conference on Mobile Data Management, pp 115\u2013124","DOI":"10.1109\/MDM.2010.40"},{"key":"497_CR8","doi-asserted-by":"crossref","unstructured":"Cao B, Alarabi L, Mokbel MF, Basalamah A (2015) SHAREK: a scalable dynamic ride sharing system. In: 16th IEEE International Conference on Mobile Data Management, vol\u00a01, pp 4\u201313","DOI":"10.1109\/MDM.2015.12"},{"key":"497_CR9","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X, Yu JX (2009) Monitoring path nearest neighbor in road networks. In: ACM SIGMOD International Conference on Management of data, pp 591\u2013602","DOI":"10.1145\/1559845.1559907"},{"key":"497_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to Algorithms, 3rd edn. MIT Press","edition":"3"},{"key":"497_CR11","unstructured":"dataset06 (2006) 9th DIMACS implementation challenge - shortest paths. http:\/\/users.diag.uniroma1.it\/challenge9\/download.shtml"},{"key":"497_CR12","doi-asserted-by":"crossref","unstructured":"Demiryurek U, Banaei-Kashani F, Shahabi C (2010) TransDec: a spatiotemporal query processing framework for transportation systems. In: 26th International Conference on Data Engineering, pp 1197\u20132000","DOI":"10.1109\/ICDE.2010.5447745"},{"key":"497_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-25249-5_9","volume":"6970","author":"MT Dickerson","year":"2010","unstructured":"Dickerson MT, Goodrich MT, Dickerson TD (2010) Roundtrip voronoi diagrams and doubling density in geographic networks. Transactions on Computational Science 6970:211\u2013238","journal-title":"Transactions on Computational Science"},{"issue":"1","key":"497_CR14","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. Numerische Mathematik 1(1):269\u2013271","journal-title":"Numerische Mathematik"},{"key":"497_CR15","doi-asserted-by":"crossref","unstructured":"Eldawy A, Mokbel MF (2015) SpatialHadoop: a MapReduce framework for spatial data. In: IEEE 31st International Conference on Data Engineering, pp 1352\u20131363","DOI":"10.1109\/ICDE.2015.7113382"},{"key":"497_CR16","doi-asserted-by":"crossref","unstructured":"Eppstein D, Goodrich MT (2008) Studying geometric graph properties of road networks through an algorithmic lens. In: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, vol\u00a016, pp 1\u201310","DOI":"10.1145\/1463434.1463455"},{"key":"497_CR17","doi-asserted-by":"crossref","unstructured":"Eppstein D, Gupta S (2017) Crossing patterns in nonplanar road networks. In: Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, vol\u00a040, pp 1\u20139","DOI":"10.1145\/3139958.3139999"},{"key":"497_CR18","unstructured":"Geisberger R, Luxen D, Neubauer S, Sanders P, Volker L (2010) Fast detour computation for ride sharing. 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems pp 88\u201399"},{"key":"497_CR19","doi-asserted-by":"crossref","unstructured":"Ghosh D, Gupta P (2016) Roundtrip nearest neighbors on road networks for location based services. In: IEEE International Conference on Computational Intelligence and Computing Research, pp 310\u2013313","DOI":"10.1109\/ICCIC.2016.7919596"},{"key":"497_CR20","unstructured":"Goldberg AV, Harrelson C (2005) Computing the shortest path: A* search meets graph theory. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp 156\u2013165"},{"key":"497_CR21","unstructured":"Goldberg AV, Werneck RF (2005) Computing point-to-point shortest paths from external memory. In: Proceedings of the SIAM Workshop on Algorithms Engineering and Experimentation, pp 26\u201340"},{"key":"497_CR22","first-page":"261","volume":"335","author":"P Gupta","year":"2015","unstructured":"Gupta P (2015) Algorithms for road network range queries in location lased services. Proceedings of International Conference on Computational Advancement in Communication Circuits and Systems 335:261\u2013267","journal-title":"Proceedings of International Conference on Computational Advancement in Communication Circuits and Systems"},{"key":"497_CR23","doi-asserted-by":"crossref","unstructured":"Hendawi AM, Bao J, Mokbel MF, Ali M (2015) Predictive tree: An efficient index for predictive queries on road networks. In: 31st International Conference on Data Engineering, pp 1215\u20131226","DOI":"10.1109\/ICDE.2015.7113369"},{"key":"497_CR24","doi-asserted-by":"crossref","unstructured":"Hjaltason GR, Samet H (1995) Ranking in spatial databases. In: Egenhofer MJ, Herring JR (eds) Advances in Spatial Databases\u20144th International Symposium, SSD\u201995, Portland, ME, LNCS series 951, pp 83\u201395","DOI":"10.1007\/3-540-60159-7_6"},{"key":"497_CR25","unstructured":"Hu H, Lee D, Lee VCS (2006a) Distance indexing on road networks. In: Proceeding of 32nd International Conference on Very Large Databases, pp 894\u2013905"},{"key":"497_CR26","first-page":"186","volume":"3896","author":"H Hu","year":"2006","unstructured":"Hu H, Lee DL, Xu J (2006) Fast nearest neighbour search on road networks. International Conference on Extending Database Technology, LNCS 3896:186\u2013203","journal-title":"International Conference on Extending Database Technology, LNCS"},{"issue":"3","key":"497_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1670679.1670682","volume":"42","author":"S Ilarri","year":"2010","unstructured":"Ilarri S, Mena E, Illarramendi A (2010) Location-dependent query processing\u202f: Where we are and where we are heading. ACM Computing Surveys 42(3):1\u201367","journal-title":"ACM Computing Surveys"},{"key":"497_CR28","doi-asserted-by":"crossref","unstructured":"Kolahdouzan M, Shahabi C (2004) Voronoi-based K-nearest neighbour search for spatial network databases. In: Proceedings of the 13th international conference on very large databases, vol\u00a030, pp 840\u2013851","DOI":"10.1016\/B978-012088469-8.50074-7"},{"issue":"3","key":"497_CR29","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1109\/TKDE.2010.243","volume":"24","author":"KCK Lee","year":"2012","unstructured":"Lee KCK, Lee WC, Zheng B, Tian Y (2012) Fast object search on road networks. IEEE Transactions on Knowledge and Data Engineering 24(3):547\u2013560","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"497_CR30","unstructured":"Ma S, Feng K, Wang H, Li J, Huai J (2014) Distance landmarks revisited for road graphs. arXiv:1401.2690"},{"issue":"3","key":"497_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3341818","volume":"5","author":"MT Mahin","year":"2019","unstructured":"Mahin MT, Hashem T (2019) Activity-aware ridesharing group trip planning queries for flexible POIs. ACM Transactions on Spatial Algorithms and Systems 5(3):1\u201341","journal-title":"ACM Transactions on Spatial Algorithms and Systems"},{"issue":"4","key":"497_CR32","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/197405.197408","volume":"26","author":"J Matousek","year":"1994","unstructured":"Matousek J (1994) Geometric range searching. ACM Computing Surveys 26(4):421\u2013461","journal-title":"ACM Computing Surveys"},{"issue":"7","key":"497_CR33","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1109\/TKDE.2011.52","volume":"24","author":"S Nutanong","year":"2012","unstructured":"Nutanong S, Tanin E, Shao J, Zhang R, Ramamohanarao K (2012) Continuous detour queries in spatial networks. IEEE Transactions on Knowledge and Data Engineering 24(7):1201\u20131215","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"497_CR34","doi-asserted-by":"crossref","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network database. In: Proceedings of the 29th VLDB Conference, vol\u00a029, pp 802\u2013813","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"497_CR35","doi-asserted-by":"crossref","unstructured":"Peng S, Sankaranarayanan J, Samet H (2016) SPDO: High-throughput road distance computations on Spark using distance oracles. In: Proceedings of the 32nd IEEE International Conference on Data Engineering, Helsinki, Finland, pp 1239\u20131250","DOI":"10.1109\/ICDE.2016.7498328"},{"key":"497_CR36","doi-asserted-by":"crossref","unstructured":"Peng S, Sankaranarayanan J, Samet H (2018) DOS: a spatial system offering extremely high-throughput road distance computations. In: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp 199\u2013208","DOI":"10.1145\/3274895.3274898"},{"key":"497_CR37","doi-asserted-by":"crossref","unstructured":"Peque G, Urata J, Iryo T (2018) Preprocessing parallelization for the ALT-algorithm. In: Proceedings of the 18th International Conference on Computational Science, pp 89\u2013101","DOI":"10.1007\/978-3-319-93713-7_7"},{"key":"497_CR38","first-page":"127","volume":"6","author":"I Pohl","year":"1971","unstructured":"Pohl I (1971) Bi-directional search. Machine Intelligence 6:127\u2013140","journal-title":"Machine Intelligence"},{"key":"497_CR39","doi-asserted-by":"crossref","unstructured":"Potamias M, Bonchi F, Castillo C, Gionis A (2009) Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM conference on Information and knowledge management, pp 867\u2013876","DOI":"10.1145\/1645953.1646063"},{"issue":"1","key":"497_CR40","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TKDE.2012.253","volume":"26","author":"M Qiao","year":"2014","unstructured":"Qiao M, Cheng H, Chang L, Yu JX (2014) Approximate shortest distance computing: a query-dependent local landmark scheme. IEEE Transactions on Knowledge and Data Engineering 26(1):55\u201368","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"497_CR41","unstructured":"Saha RR, Hashem T, Shahriar T, Kulik L (2018) Continuous obstructed detour queries. In: 10th International Conference on Geographic Information Science, vol 114, pp 1\u201314"},{"key":"497_CR42","doi-asserted-by":"crossref","unstructured":"Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the ACM SIGMOD Conference, Vancouver, Canada, pp 43\u201354","DOI":"10.1145\/1376616.1376623"},{"key":"497_CR43","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan J, Samet H (2009) Distance oracles for spatial networks. In: Proceedings of the 25th IEEE International Conference on Data Engineering, Shanghai, China, pp 652\u2013663","DOI":"10.1109\/ICDE.2009.53"},{"issue":"2","key":"497_CR44","first-page":"4","volume":"33","author":"J Sankaranarayanan","year":"2010","unstructured":"Sankaranarayanan J, Samet H (2010) Roads belong in databases. IEEE Data Engineering Bulletin 33(2):4\u201311","journal-title":"IEEE Data Engineering Bulletin"},{"key":"497_CR45","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan J, Alborzi H, Samet H (2005) Efficient query processing on spatial networks. In: Proceedings of the 13th ACM International Symposium on Advances in Geographic Information Systems, Bremen, Germany, pp 200\u2013209","DOI":"10.1145\/1097064.1097093"},{"issue":"1","key":"497_CR46","first-page":"1210","volume":"2","author":"J Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. PVLDB 2(1):1210\u20131221","journal-title":"Path oracles for spatial networks. PVLDB"},{"key":"497_CR47","unstructured":"Schultes D (2008) Route planning in road networks. PhD thesis, Institut fur Theoretische Informatik"},{"key":"497_CR48","doi-asserted-by":"crossref","unstructured":"Shang S, Deng K, Xie K (2010) Best point detour query in road networks. In: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp 71\u201380","DOI":"10.1145\/1869790.1869804"},{"issue":"4","key":"497_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer C (2014) Shortest-path queries in static networks. ACM Computing Surveys 46(4):1\u201331","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"497_CR50","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/TKDE.2014.2330836","volume":"27","author":"W Sun","year":"2012","unstructured":"Sun W, Chen C, Zheng B, Chen C, Liu P (2012) An air index for proximity query processing in road networks. IEEE Transactions on Knowledge and Data Engineering 27(2):382\u2013395","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"8","key":"497_CR51","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1016\/j.jcss.2014.12.025","volume":"81","author":"D Taniar","year":"2015","unstructured":"Taniar D, Rahayu W (2015) A taxonomy for region queries in spatial databases. Journal of Computer and System Sciences 81(8):1508\u20131531","journal-title":"Journal of Computer and System Sciences"},{"key":"497_CR52","doi-asserted-by":"crossref","unstructured":"Xuan K, Zhao G, Taniar D, Srinivasan B, Safar MH, Gavrilova M (2009) Network voronoi diagram based range search. In: Proceedings of the IEEE International Conference on Advanced Information Networking and Applications, pp 741\u2013748","DOI":"10.1109\/AINA.2009.82"},{"issue":"2","key":"497_CR53","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10707-005-6671-1","volume":"9","author":"JS Yoo","year":"2005","unstructured":"Yoo JS, Shekhar S (2005) In-route nearest neighbor queries. GeoInformatica 9(2):117\u2013137","journal-title":"GeoInformatica"},{"issue":"1","key":"497_CR54","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10707-018-0330-9","volume":"23","author":"J Yu","year":"2018","unstructured":"Yu J, Zhang Z, Sarwat M (2018) Spatial data management in Apache Spark: the GeoSpark perspective and beyond. Geoinformatica 23(1):37\u201378","journal-title":"Geoinformatica"},{"key":"497_CR55","doi-asserted-by":"crossref","unstructured":"Yuan J, Zheng Y, Zhang C, Xie W, Xie X, Sun G, Huang Y (2010) T-Drive: driving directions based on taxi trajectories. In: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp 99\u2013108","DOI":"10.1145\/1869790.1869807"},{"key":"497_CR56","doi-asserted-by":"crossref","unstructured":"Yuen CF, Singh AP, Goyal S, Ranu S, Bagchi A (2019) Beyond shortest paths: route recommendations for ride-sharing. In: The World Wide Web, p 2258-2269","DOI":"10.1145\/3308558.3313465"},{"issue":"1","key":"497_CR57","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00778-004-0146-0","volume":"15","author":"B Zheng","year":"2006","unstructured":"Zheng B, Xu J, Lee WC, Lee L (2006) Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services. International Journal of Very Large Data Bases 15(1):21\u201339","journal-title":"International Journal of Very Large Data Bases"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-023-00497-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-023-00497-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-023-00497-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T05:10:35Z","timestamp":1705122635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-023-00497-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,3]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["497"],"URL":"https:\/\/doi.org\/10.1007\/s10707-023-00497-2","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,3]]},"assertion":[{"value":"7 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}