Skip to main content
SpringerLink
Log in

Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2020)

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

Included in the following conference series:

Abstract

We introduce a dynamic and stochastic rematching problem with applications in request matching for ridesharing systems. We propose three mathematical programming formulations that can be used in a rolling horizon framework to solve this problem. We show how these models can be simplified provided that specific conditions that are typically found in practice are met.

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

Access this chapter

Log in via an institution
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

References

  1. Agatz, N.A.H., Erera, A.L., Savelsbergh, M.W.P., Wang, X.: Dynamic ride-sharing: a simulation study in metro Atlanta. Transp. Res. Part B Methodol. 45(9), 1450–1464 (2011)

    Article  Google Scholar 

  2. Wang, X., Agatz, N., Erera, A.: Stable matching for dynamic ride-sharing systems. Transp. Sci. 52(4), 850–867 (2018)

    Article  Google Scholar 

  3. Stiglic, M., Agatz, N., Savelsbergh, M., Gradisar, M.: The benefits of meeting points in ride-sharing systems. Transp. Res. Part B Methodol. 82, 36–53 (2015)

    Article  Google Scholar 

  4. Stiglic, M., Agatz, N., Savelsbergh, M., Gradisar, M.: Making dynamic ride-sharing work: the impact of driver and rider flexibility. Transp. Res. Part E Logist. Transp. Rev. 91, 190–207 (2016)

    Article  Google Scholar 

  5. Stiglic, M., Agatz, N., Savelsbergh, M., Gradisar, M.: Enhancing urban mobility: integrating ride-sharing and public transit. Comput. Oper. Res. 90, 12–21 (2018)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  7. Furuhata, M., Dessouky, M., Ordóñez, F., Brunet, M.E., 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 

  8. Mourad, A., Puchinger, J., Chu, C.: A survey of models and algorithms for optimizing shared mobility. Transp. Res. Part B Methodol. 123, 323–346 (2019)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Operations Research, Université de Montréal and CIRRELT, Montreal, Canada

    Gabriel Homsi & Bernard Gendron

  2. Department of Analytics, Operations and Information Technology, École des Sciences de la Gestion, Université du Québec à Montréal and CIRRELT, Montreal, Canada

    Sanjay Dominik Jena

Authors
  1. Gabriel Homsi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard Gendron
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sanjay Dominik Jena
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gabriel Homsi .

Editor information

Editors and Affiliations

  1. CNRS and Université Clermont Auvergne, Aubière, France

    Mourad Baïou

  2. Département d'informatique et de recherche opérationnelle & CIRRELT, University of Montreal, Montréal, QC, Canada

    Bernard Gendron

  3. School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA

    Oktay Günlük

  4. Laboratoire LAMSADE, Université Paris-Dauphine, Paris, France

    A. Ridha Mahjoub

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Homsi, G., Gendron, B., Jena, S.D. (2020). Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions. In: Baïou, M., Gendron, B., Günlük, O., Mahjoub, A.R. (eds) Combinatorial Optimization. ISCO 2020. Lecture Notes in Computer Science(), vol 12176. Springer, Cham. https://doi.org/10.1007/978-3-030-53262-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-53262-8_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-53261-1

  • Online ISBN: 978-3-030-53262-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation