Skip to main content

CrowdDeliver: Making Citywide Packages Arrive as soon as Possible

  • Chapter
  • First Online:
Enabling Smart Urban Services with GPS Trajectory Data
  • 471 Accesses

Abstract

It is still difficult to make the express service profitable, despite recent years have witnessed the great demand on and attempts at the service of package express shipping. The main barrier may be due to that the speedy usually implies a higher sending frequency. To strike a trade-off between the two conflicting objectives, we propose a new idea that exploits the existing taxi mobility to transport packages collectively (i.e., the relays among different passenger-occupied taxis), without hurting the service quality to passengers too much. In more detail, we propose and develop a novel framework called CrowdDeliver, which is a two-phase approach to plan package delivery paths. In the first phase, for any give OD (i.e., Origin-Destination) pairs, we aim to identify the shortest delivery paths and also with the corresponding travel times by mining the historical taxi trajectory data offline. In the second phase, using the obtained paths and travel times as the reference to guide the adaptive path-finding, we propose an online taxi scheduling algorithm that aims to discover the near-optimal path iteratively upon the newly incoming taxi ride requests. Finally, with the large-scale taxi trajectory data collected from real life and the package delivery requests generated artificially, we conduct extensive experiments to verify the performance of CrowdDeliver. The experimental results are promising and show that more than 85% packages can be sent to their destinations within 8 h, with an average taxi relay of 4.2.

Part of this chapter is based on a previous work: C. Chen et al., “Crowddeliver: Planning City-Wide Package Delivery Paths Leveraging the Crowd of Taxis,” in IEEE Transactions on Intelligent Transportation Systems, vol. 18, no. 6, pp. 1478–1496, June 2017, doi: https://doi.org/10.1109/TITS.2016.2607458.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Rohm AJ, Swaminathan V. A typology of online shoppers based on shopping motivations. J Bus Res. 2004;57(7):748–57.

    Article  Google Scholar 

  2. “Same-Day Dreamer,” Economist, London, England, 2014. [Online]. http://www.economist.com/news/business/

  3. Bast H, Delling D, Goldberg A, et al. Route planning in transportation networks[M]//Algorithm engineering. Cham: Springer; 2016. p. 19–80.

    Google Scholar 

  4. Zheng X, Liang X, Xu K. Where to wait for a taxi? New York: Proceedings of the ACM SIGKDD International Workshop on Urban Computing; 2012. p. 149–56.

    Google Scholar 

  5. Chen P, Chankov S. Crowdsourced delivery for last-mile distribution: an agent-based modelling and simulation approach. In: 2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). New York: IEEE; 2017. p. 1271–5.

    Chapter  Google Scholar 

  6. Du J, Guo B, Liu Y, Wang L, Han Q, Chen C, CrowDNet ZY. Enabling a crowdsourced object delivery network based on modern portfolio theory. IEEE Internet Things J. 2019;6(5):9030–41.

    Article  Google Scholar 

  7. Sadilek A, Krumm J, Horvitz E. Crowdphysics: planned and opportunistic crowdsourcing for physical tasks. Atlanta: Proceedings of ICWSM; 2013.

    Google Scholar 

  8. Sadilek A, Kautz H, Bigham JP. Finding your friends and following them to where you are. New York: Proceedings of the fifth ACM International Conference on Web Search and Data Mining; 2012. p. 723–32.

    Google Scholar 

  9. McInerney J, Rogers A, Jennings NR. Crowdsourcing physical package delivery using the existing routine mobility of a local population. New York: The Orange D4D Challenge; 2014.

    Google Scholar 

  10. Arslan AM, Agatz N, Kroon L, Zuidwijk R. Crowdsourced delivery—a dynamic pickup and delivery problem with ad hoc drivers. Transp Sci. 2019;53(1):222–35.

    Article  Google Scholar 

  11. Devari A. Crowdsourced last mile delivery using social networks, M.S. thesis. State University, New York: Buffalo, NY, USA; 2016.

    Google Scholar 

  12. Chen C, Wang Z, Zhang D. Sending more with less: crowdsourcing integrated transportation as a new form of citywide passenger–package delivery system. IT Profess. 2020;22(1):56–62.

    Article  Google Scholar 

  13. Chen C, et al. CrowdDeliver: planning city-wide package delivery paths leveraging the crowd of taxis. IEEE Trans Intell Transp Syst. 2017;18(6):1478–96.

    Google Scholar 

  14. Chen W, Mes M, Schutten M. Multi-hop driver-parcel matching problem with time windows. Flex Serv Manuf J. 2017;30:517–53.

    Article  Google Scholar 

  15. Hu Z, Askin RG, Hu G. Hub relay network design for daily driver routes[J]. Int J Prod Res. 2019;57(19):6130–45.

    Article  Google Scholar 

  16. Castro PS, Zhang D, Li S. Urban traffic modelling and prediction using large scale taxi GPS traces. New York: Proceedings of International Conference on Pervasive Computing; 2012. p. 57–72.

    Google Scholar 

  17. Yue Y, Zhuang Y, Li Q, Mao Q. Mining time-dependent attractive areas and movement patterns from taxi trajectory data. New York: Proc. IEEE International Conference on Geoinformatics; 2009. p. 1–6.

    Google Scholar 

  18. Dean BC. Continuous-time dynamic shortest path algorithms, M.S. thesis. Dept. Comput. Sci., MIT: Cambridge, MA, USA; 1999.

    Google Scholar 

  19. Zhang L, Yu B, Pan J. Geomob: a mobility-aware geocast scheme in metropolitans via taxicabs and buses. New York: Proceedings of IEEE INFOCOM 2014-IEEE Conference on Computer Communications; 2014. p. 1279–787.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chen, C., Zhang, D., Wang, Y., Huang, H. (2021). CrowdDeliver: Making Citywide Packages Arrive as soon as Possible. In: Enabling Smart Urban Services with GPS Trajectory Data. Springer, Singapore. https://doi.org/10.1007/978-981-16-0178-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-0178-1_12

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-0177-4

  • Online ISBN: 978-981-16-0178-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics