Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches

DOI10.1016/J.DAM.2023.10.016OpenAlexW4388159066MaRDI QIDQ6140244

Bernard Gendron, Gabriel Homsi, Sanjay Dominik Jena

Publication date: 2 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.10.016

zbMATH Keywords

stochastic optimizationbipartite matchingrematchingrolling horizonridesharing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Combinatorial optimization (90C27)

Cites Work

• Enhancing urban mobility: integrating ride-sharing and public transit
• Dynamic and stochastic rematching for ridesharing systems: formulations and reductions
• Optimization for dynamic ride-sharing: a review
• Column generation for real-time ride-sharing operations
• Introduction to Stochastic Programming
• An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation

This page was built for publication: Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches