Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions

摘要

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.