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.
Author supplied keywords
Cite
CITATION STYLE
Homsi, G., Gendron, B., & Jena, S. D. (2020). Dynamic and stochastic rematching for ridesharing systems: Formulations and reductions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12176 LNCS, pp. 193–201). Springer. https://doi.org/10.1007/978-3-030-53262-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
