A Time-invariant Network Flow Model for Ride-pooling in Mobility-on-Demand Systems
The paper introduces a framework to integrate ride-pooling into time-invariant network flow models for Mobility-on-Demand systems. It transforms a complex combinatorial problem into a solvable linear one by defining conditions for feasible pooling based on travel time and waiting time thresholds. This allows for the computation of an optimal ride-pooling assignment that minimizes user travel time.