Dynamic and stochastic rematching for ridesharing systems: formulations and reductions

DOI10.1007/978-3-030-53262-8_16zbMath1458.90547OpenAlexW3045481665MaRDI QIDQ2225063

Bernard Gendron, Gabriel Homsi, Sanjay Dominik Jena

Publication date: 4 February 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-53262-8_16

zbMATH Keywords

stochastic programmingridesharingrequest matching

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (2)

Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches ⋮ Two‐stage stochastic one‐to‐many driver matching for ridesharing

This page was built for publication: Dynamic and stochastic rematching for ridesharing systems: formulations and reductions