← Volver a resultados
Ficha bibliográfica · Consulta y acceso
Artículo

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

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

Acceso abierto disponible
Lectura rápida. Revisá los datos básicos del recurso y luego accedé al contenido desde el botón principal. En esta ficha solo se muestra la información necesaria para identificar la obra, citarla y abrirla.

Acceso al recurso

Entrá al contenido desde la opción principal o elegí otra fuente disponible.

Acceso principal

Acceso abierto disponible

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

Resumen

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.

Cómo citar

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 28 Jun. 2026].

Compartir e imprimir

Guardá la ficha, copiá su enlace permanente o imprimila como PDF.

Exportar referencia

Si usás un gestor bibliográfico, podés exportar el registro en los formatos más comunes.

Detalles del recurso

Información bibliográfica útil para confirmar que se trata del material correcto.

Título
A predictive chance constraint rebalancing approach to mobility-on-demand services
Autor / colaboradores
Sten Elling Tingstad Jacobsen et al
Editorial
Tsinghua University Press
Año de publicación
2023
ISSN
2772-4247
ISSN
2772-4247
Idioma
eng

Materias

Explorá otros recursos relacionados a partir de estas materias.

Copiado