Corpus ID: 226281741

Matching Drivers to Riders: A Two-stage Robust Approach.

@article{Housni2020MatchingDT,
  title={Matching Drivers to Riders: A Two-stage Robust Approach.},
  author={Omar El Housni and Vineet Goyal and Oussama Hanguir and C. Stein},
  journal={arXiv: Optimization and Control},
  year={2020}
}
Matching demand (riders) to supply (drivers) efficiently is a fundamental problem for ride-sharing platforms who need to match the riders (almost) as soon as the request arrives with only partial knowledge about future ride requests. A myopic approach that computes an optimal matching for current requests ignoring future uncertainty can be highly sub-optimal. In this paper, we consider a two-stage robust optimization framework for this matching problem where future demand uncertainty is modeled… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 34 REFERENCES
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
How to pay, come what may: approximation algorithms for demand-robust covering problems
Commitment under uncertainty: Two-stage stochastic matching problems
Maintaining Perfect Matchings at Low Cost
Thresholded covering algorithms for robust and max–min optimization
...
1
2
3
4
...