Skip to main content

Urban Hitchhiking

  • Conference paper
Fun with Algorithms (FUN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6099))

Included in the following conference series:

  • 1430 Accesses

Abstract

You are an urban hitchhiker. All drivers are willing to give you a ride, as long as they do not have to alter their trajectories to accommodate your needs. How (and how quickly) can you get to your destination? We analyze two scenarios, depending on whether hitchhikers have a global picture of who is going where through some information infrastructure, or only a local picture - i.e. they can only ask cars passing by where they are going.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdel-Naby, S., Fante, S.: Auctions negotiation for mobile rideshare service. In: Proc. IEEE Second International Conference on Pervasive Computing and Applications (2007)

    Google Scholar 

  2. Buliung, R., Soltys, K., Habel, C., Lanyon, R.: Driving factors behind successful carpool formation and use. Transportation Research Record: Journal of the Transportation Research Board 2118 (2009)

    Google Scholar 

  3. Calvo, R.W., de Luigi, F., Haastrup, P., Maniezzo, V.: A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13), 2263–2278 (2004)

    Article  MATH  Google Scholar 

  4. Hartwig, S., Buchmann, M.: Empty seats traveling: Next-generation ridesharing and its potential to mitigate traffic and emission problems in the 21st century. Technical report, Nokia (2007), http://research.nokia.com/tr/NRC-TR-2007-003.pdf

  5. Kelley, K.: Casual carpooling–enhanced. Journal of Public Transportation 10(4) (2007)

    Google Scholar 

  6. Klar, A., Kuehne, R., Wegener, R.: Mathematical models for vehicular traffic. Survey on Mathematics for Industry (1996)

    Google Scholar 

  7. Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (2000)

    Google Scholar 

  8. Morris, J.: Saferide: Reducing single occupancy vehicles. Technical report (2008), http://www.cs.cmu.edu/~jhm/SafeRide.pdf

  9. Murphy, P.: The smart jitney: Rapid, realistic transport. New Solutions Journal (4) (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bressan, M., Peserico, E. (2010). Urban Hitchhiking. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13122-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13121-9

  • Online ISBN: 978-3-642-13122-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics