Skip to main content
SpringerLink
Log in

Opportunistic package delivery as a service on road networks

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

In the new “gig” economy, a user plays the role of a consumer as well as a service provider. As a service provider, drivers travelling from a source to a destination may opportunistically pickup and drop-off packages along the way if that does not add significantly to their trip distance or time. This gives rise to a new business offering called Package Delivery as a Service (PDaaS) that brokers package pickups and deliveries at one end and connects them to drivers on the other end, thus creating an ecosystem of supply and demand. The dramatic cost savings of such a service model come from the fact that the driver is already en-route to their destination and the package delivery adds a small overhead to an already pre-planned trip. From a technical perspective, this problem introduces new technical challenges that are uncommon in the literature. The driver may want to optimise for distance or time. Furthermore, new packages arrive for delivery all the time and are assigned to various drivers continuously. This means that the algorithm has to work in an environment that is dynamic, thereby precluding most standard road network precomputation efforts. Furthermore, the number of packages that are available for delivery could be in the hundreds of thousands, which has to be quickly pruned down for the algorithm to scale. The paper proposes a variation called dual Dijkstra’s that combines a forward and a backward scan in order to find delivery options that satisfy the constraints specified by the driver. The new dual heuristic improves the standard single Dijkstra’s approach by narrowing down the search space, thus resulting in significant speed-ups over the standard algorithms. Furthermore, a combination of dual Dijkstra’s with a heuristic landmark approach results in a dramatic speed-up compared to the baseline algorithms. Experimental results show that the proposed approach can offer drivers a choice of packages to deliver under specified constraints of time or distance, and providing sub-second response time despite the complexity of the problem involved. As the number of packages in the system increases, the matchmaking process becomes easier resulting in faster response times. The scalability of the PDaaS infrastructure is demonstrated using extensive experimental results.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

Data Availability

The datasets generated during and/or analysed during the current study are available.

References

  1. 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–503

  2. Agarwal PK, Erickson J (1999) Geometric range searching and its relatives. Advances in Discrete and Computational Geometry, Contemporary Mathematics 223:1–56

    Article  MathSciNet  Google Scholar 

  3. Ahuja R, Magnanti T, Orlin J (1993) Network Flows: Theory, Algorithms, and Applications, 1st edn. Pearson

  4. 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 14, pp 1–4

  5. 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–323

    Article  Google Scholar 

  6. 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–514

    Article  Google Scholar 

  7. 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–124

  8. 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 1, pp 4–13

  9. 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–602

  10. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to Algorithms, 3rd edn. MIT Press

    Google Scholar 

  11. dataset06 (2006) 9th DIMACS implementation challenge - shortest paths. http://users.diag.uniroma1.it/challenge9/download.shtml

  12. 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–2000

  13. Dickerson MT, Goodrich MT, Dickerson TD (2010) Roundtrip voronoi diagrams and doubling density in geographic networks. Transactions on Computational Science 6970:211–238

    Article  Google Scholar 

  14. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269–271

    Article  MathSciNet  Google Scholar 

  15. Eldawy A, Mokbel MF (2015) SpatialHadoop: a MapReduce framework for spatial data. In: IEEE 31st International Conference on Data Engineering, pp 1352–1363

  16. 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 16, pp 1–10

  17. 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 40, pp 1–9

  18. 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–99

  19. 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–313

  20. 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–165

  21. 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–40

  22. 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–267

    Google Scholar 

  23. 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–1226

  24. Hjaltason GR, Samet H (1995) Ranking in spatial databases. In: Egenhofer MJ, Herring JR (eds) Advances in Spatial Databases—4th International Symposium, SSD’95, Portland, ME, LNCS series 951, pp 83–95

  25. Hu H, Lee D, Lee VCS (2006a) Distance indexing on road networks. In: Proceeding of 32nd International Conference on Very Large Databases, pp 894–905

  26. Hu H, Lee DL, Xu J (2006) Fast nearest neighbour search on road networks. International Conference on Extending Database Technology, LNCS 3896:186–203

    Google Scholar 

  27. Ilarri S, Mena E, Illarramendi A (2010) Location-dependent query processing : Where we are and where we are heading. ACM Computing Surveys 42(3):1–67

    Article  Google Scholar 

  28. 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 30, pp 840–851

  29. 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–560

    Article  Google Scholar 

  30. Ma S, Feng K, Wang H, Li J, Huai J (2014) Distance landmarks revisited for road graphs. arXiv:1401.2690

  31. 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–41

    Article  Google Scholar 

  32. Matousek J (1994) Geometric range searching. ACM Computing Surveys 26(4):421–461

    Article  MathSciNet  Google Scholar 

  33. 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–1215

    Article  Google Scholar 

  34. Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network database. In: Proceedings of the 29th VLDB Conference, vol 29, pp 802–813

  35. 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–1250

  36. 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–208

  37. 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–101

  38. Pohl I (1971) Bi-directional search. Machine Intelligence 6:127–140

    MathSciNet  Google Scholar 

  39. 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–876

  40. 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–68

    Article  Google Scholar 

  41. 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–14

  42. 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–54

  43. 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–663

  44. Sankaranarayanan J, Samet H (2010) Roads belong in databases. IEEE Data Engineering Bulletin 33(2):4–11

    Google Scholar 

  45. 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–209

  46. Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. PVLDB 2(1):1210–1221

    Google Scholar 

  47. Schultes D (2008) Route planning in road networks. PhD thesis, Institut fur Theoretische Informatik

  48. 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–80

  49. Sommer C (2014) Shortest-path queries in static networks. ACM Computing Surveys 46(4):1–31

    Article  Google Scholar 

  50. 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–395

    Article  Google Scholar 

  51. Taniar D, Rahayu W (2015) A taxonomy for region queries in spatial databases. Journal of Computer and System Sciences 81(8):1508–1531

    Article  MathSciNet  Google Scholar 

  52. 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–748

  53. Yoo JS, Shekhar S (2005) In-route nearest neighbor queries. GeoInformatica 9(2):117–137

    Article  Google Scholar 

  54. Yu J, Zhang Z, Sarwat M (2018) Spatial data management in Apache Spark: the GeoSpark perspective and beyond. Geoinformatica 23(1):37–78

    Article  Google Scholar 

  55. 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–108

  56. 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

  57. 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–39

    Article  Google Scholar 

Download references

Funding

Hanan Samet is funded by NSF award 2114451.

Author information

Authors and Affiliations

  1. BML Munjal University, Haryana, India

    Debajyoti Ghosh & Kiran Khatter

  2. Google Inc., Sunnyvale, CA, USA

    Jagan Sankaranarayanan

  3. University of Maryland, College Park MD, USA

    Hanan Samet

Authors
  1. Debajyoti Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jagan Sankaranarayanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kiran Khatter
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hanan Samet
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All the authors contributed to the problem definitions, algorithms, experiments, and related work. Debajyoti Ghosh and Jagan Sankaranarayanan contributed to the main manuscript text and prepared figures. Kiran Khatter and Hanan Samet contributed by suggesting revisions, extensions, and commenting on experimental results.

Corresponding author

Correspondence to Debajyoti Ghosh.

Ethics declarations

Conflicts of interest

The authors declare that they have no competing interests.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghosh, D., Sankaranarayanan, J., Khatter, K. et al. Opportunistic package delivery as a service on road networks. Geoinformatica 28, 53–88 (2024). https://doi.org/10.1007/s10707-023-00497-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-023-00497-2

Keywords

Search

Navigation