Skip to main content

Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach

  • Conference paper
  • First Online:
Book cover Operations Research and Enterprise Systems (ICORES 2015)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 577))

Included in the following conference series:

Abstract

Improving transportation efficiency without increasing urban traffic congestion, requires to carry out new services such as ridesharing which contributes to reduce operating cost and to save road resources. In this paper, we provide users of a ridesharing system greater flexibility: given a set of drivers’ offers already in the system, and a new rider’s request, we determine a best driver, a best pick-up and drop-off locations, and a sharing cost rate between rider and driver for their common path. The main idea of our approaches consists in labelling interesting nodes of a geographical map with information about drivers, in so-called buckets. Based on the information contained in these buckets, when a rider enters the system we determine a best driver, as well as a best pick-up and drop-off locations that minimize the total travel cost of rider and driver. Exact and heuristic approaches to identify a best driver, as well as a best pick-up and drop-off locations are proposed. Finally, we perform a comparative evaluation using real road network of the Lorraine region (FR) and real data provided by a local company. Experimental analysis shows a running time of a few seconds while improving participants’ cost-savings and matching rate compared to the recurring ridesharing.

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 EPUB and 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

Notes

  1. 1.

    http://www.covivo.fr.

  2. 2.

    http://www.openstreetmap.org.

References

  1. Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223, 295–303 (2012)

    Article  MATH  Google Scholar 

  2. Aissat, K., Oulamara, A.: Dynamic ridesharing with intermediate locations. In: Symposium Series on Computational Intelligence (SSCI) (2014)

    Google Scholar 

  3. Aissat, K., Oulamara, A.: Round trip ridesharing with an intermediate meeting location. In: Proceedings of MOSIM 2014 (2014)

    Google Scholar 

  4. Bit-Monnot, A., Artigues, C., Huguet, M.J., Killijian, M.O.: Carpooling: the 2 synchronization points shortest paths problem. In: OASIcs-OpenAccess Series in Informatics, vol. 33. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Furuhata, M., Dessouky, M., Brunet, F.O.M., Wang, X., Koenig, S.: Ridesharing: the state-of-the-art and future directions. Transp. Res. Part B Methodol. 57, 28–46 (2013)

    Article  Google Scholar 

  7. Geisberger, R., Luxen, D., Neubauer, S., Sanders, P., Volker, L.: Fast detour computation for ride sharing. In: Erlebach, T., Lubbecke, M. (eds.) 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2010, pp. 88–99 (2010)

    Google Scholar 

  8. Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46, 388–404 (2012)

    Article  Google Scholar 

  9. Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100–107 (1968)

    Article  Google Scholar 

  10. Ma, S., Wolfson, O.: Analysis and evaluation of the slugging form of ridesharing. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 64–73. ACM (2013)

    Google Scholar 

  11. Ma, S., Zheng, Y., Wolfson, O.: T-share: a large-scale dynamic taxi ridesharing service. In: IEEE 29th International Conference on Data Engineering (ICDE 2013), pp. 410–421. IEEE (2013)

    Google Scholar 

  12. Metz, B., Davidson, O., De Coninck, H., Loos, M., Meyer, L.: IPCC Special Report on Carbon Dioxide Capture and Storage. Cambridge University Press, Cambridge, New York (2005)

    Google Scholar 

  13. Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 23–36. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Aissat .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Aissat, K., Oulamara, A. (2015). Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach. In: de Werra, D., Parlier, G., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2015. Communications in Computer and Information Science, vol 577. Springer, Cham. https://doi.org/10.1007/978-3-319-27680-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27680-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27679-3

  • Online ISBN: 978-3-319-27680-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics