Back to results
Bibliographic record · Consultation and access
Artículo

A predictive chance constraint rebalancing approach to mobility-on-demand services

Sten Elling Tingstad Jacobsen et al · Tsinghua University Press · 2023

Open access available
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.

Resource access

Open the content from the main option or choose another available source.

DOAJ DOAJ Articles
Entrar por DOAJ
Main access

Open access available

Recurso identificado como acceso abierto, sin confirmar automáticamente si es texto completo directo.
Open resource

Summary

Descripción general del contenido del recurso.

This paper considers the problem of supply-demand imbalances in Mobility-on-Demand (MoD) services. These imbalances occur due to uneven stochastic travel demand and can be mitigated by proactively rebalancing empty vehicles to areas where the demand is high. To achieve this, we propose a method that takes into account uncertainties of predicted travel demand while minimizing pick-up time and rebalance mileage for autonomous MoD ride-hailing. More precisely, first travel demand is predicted using Gaussian Process Regression (GPR) which provides uncertainty bounds on the prediction. We then formulate a stochastic model predictive control (MPC) for the autonomous ride-hailing service and integrate the demand predictions with uncertainty bounds. In order to guarantee constraint satisfaction in the optimization under estimated stochastic demand prediction, we employ a probabilistic constraining method with user-defined confidence interval, using Chance Constrained MPC (CCMPC). The benefits of the proposed method are twofold. First, travel demand uncertainty prediction from data can naturally be embedded into the MoD optimization framework, allowing us to keep the imbalance at each station below a certain threshold with a user-defined probability. Second, CCMPC can be relaxed into a Mixed-Integer-Linear-Program (MILP) and the MILP can be solved as a corresponding Linear-Program, which always admits an integral solution. Our transportation simulations show that by tuning the confidence bound on the chance constraint, close to optimal oracle performance can be achieved, with a median customer wait time reduction of 4% compared to using only the mean prediction of the GPR.

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

al, S. E. T. J. E. (2023). A predictive chance constraint rebalancing approach to mobility-on-demand services. https://doi.org/10.1016/j.commtr.2023.100097

MLA

al, Sten Elling Tingstad Jacobsen et. "A predictive chance constraint rebalancing approach to mobility-on-demand services." 2023. https://doi.org/10.1016/j.commtr.2023.100097.

Chicago

al, Sten Elling Tingstad Jacobsen et. 2023. "A predictive chance constraint rebalancing approach to mobility-on-demand services.". https://doi.org/10.1016/j.commtr.2023.100097.

Harvard

al, S. E. T. J. E. 2023, A predictive chance constraint rebalancing approach to mobility-on-demand services, Tsinghua University Press, available at: https://doi.org/10.1016/j.commtr.2023.100097 [Accessed 8 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
A predictive chance constraint rebalancing approach to mobility-on-demand services
Author / contributors
Sten Elling Tingstad Jacobsen et al
Publisher
Tsinghua University Press
Publication year
2023
ISSN
2772-4247
ISSN
2772-4247
Language
English

Subjects

Explore related resources through these subjects.

Copied