Two‐stage stochastic one‐to‐many driver matching for ridesharing

DOI10.1002/net.22170OpenAlexW4384406331MaRDI QIDQ6180029

Sanjay Dominik Jena, Gabriel Homsi, Bernard Gendron

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22170

zbMATH Keywords

stochastic optimizationmixed integer programmingmultiple contract levelsone-to-many matchingridesharing systemuncertain rider requests

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites Work

• Stochastic set packing problem
• A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
• 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
• Inequalities for Stochastic Linear Programming Problems
• Introduction to Stochastic Programming
• An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
• A new method for solving capacitated location problems based on a set partitioning approach

This page was built for publication: Two‐stage stochastic one‐to‐many driver matching for ridesharing