Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
A Time-Invariant Network Flow Model for Two-Person Ride-Pooling Mobility-on-Demand
This paper presents a time-invariant network flow model capturing two-person ride-pooling that can be inte-grated within design and planning frameworks for Mobility-on-Demand systems. In these type of models, the arrival process of travel requests is described by a Poisson process, meaning that there is only statistical insight into request times, including the probability that two requests may be pooled together. Taking advantage of this feature, we devise a method to capture ride-pooling from a stochastic mesoscopic perspective. This way, we are able to transform the original set of requests into an equivalent set including pooled ones which can be integrated within standard network flow problems, which in turn can be efficiently solved with off-the-shelf LP solvers for a given ride-pooling request assignment. Thereby, to compute such an assignment, we devise a polynomial-time algorithm that is optimal w.r.t. an approximated version of the problem. Finally, we perform a case study of Sioux Falls, USA, where we quantify the effects that waiting time and experienced delay have on the vehicle-hours traveled. Our results suggest that the higher the demands per unit time, the lower the waiting time and delay experienced by users. In addition, for a sufficiently large number of demands per unit time, with a maximum waiting time and experienced delay of 5 minutes, more than 90% of the requests can be pooled.
A Time-Invariant Network Flow Model for Two-Person Ride-Pooling Mobility-on-Demand
This paper presents a time-invariant network flow model capturing two-person ride-pooling that can be inte-grated within design and planning frameworks for Mobility-on-Demand systems. In these type of models, the arrival process of travel requests is described by a Poisson process, meaning that there is only statistical insight into request times, including the probability that two requests may be pooled together. Taking advantage of this feature, we devise a method to capture ride-pooling from a stochastic mesoscopic perspective. This way, we are able to transform the original set of requests into an equivalent set including pooled ones which can be integrated within standard network flow problems, which in turn can be efficiently solved with off-the-shelf LP solvers for a given ride-pooling request assignment. Thereby, to compute such an assignment, we devise a polynomial-time algorithm that is optimal w.r.t. an approximated version of the problem. Finally, we perform a case study of Sioux Falls, USA, where we quantify the effects that waiting time and experienced delay have on the vehicle-hours traveled. Our results suggest that the higher the demands per unit time, the lower the waiting time and delay experienced by users. In addition, for a sufficiently large number of demands per unit time, with a maximum waiting time and experienced delay of 5 minutes, more than 90% of the requests can be pooled.
A Time-Invariant Network Flow Model for Two-Person Ride-Pooling Mobility-on-Demand
Paparella, Fabio (Autor:in) / Pedroso, Leonardo (Autor:in) / Hofman, Theo (Autor:in) / Salazar, Mauro (Autor:in)
19.01.2024
Paparella, F, Pedroso, L, Hofman, T & Salazar, M 2024, A Time-Invariant Network Flow Model for Two-Person Ride-Pooling Mobility-on-Demand. in 2023 62nd IEEE Conference on Decision and Control, CDC 2023. Institute of Electrical and Electronics Engineers, pp. 4118-4123, 62nd IEEE Conference on Decision and Control, CDC 2023, Singapore, Singapore, 13/12/23. https://doi.org/10.1109/CDC49753.2023.10384279
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The shareability potential of ride-pooling under alternative spatial demand patterns
| BASE | 2024