|
Title: | A learning-based optimization approach for autonomous ridesharing platforms with service level contracts and on-demand hiring of idle vehicles | | Authors: | B.A. Beirigo, F. Schulte, R.R. Negenborn |
| Journal: | Transportation Science | | |
| Abstract: | Current mobility services cannot compete on equal terms with self-owned mobility products concerning service quality. Due to supply and demand imbalances, ridesharing users invariably experience delays, price surges, and rejections. Traditional approaches often fail to respond to demand fluctuations adequately since service levels are, to some extent, bounded by fleet size. With the emergence of autonomous vehicles, however, the characteristics of mobility services change and new opportunities to overcome the prevailing limitations arise. In this paper, we consider an autonomous ridesharing problem in which idle vehicles are hired ondemand in order to meet the service level requirements of a heterogeneous user base. In the face of uncertain demand and idle vehicle supply, we propose a learning-based optimization approach that uses the dual variables of the underlying assignment problem to iteratively approximate the marginal value of vehicles at each time and location under different availability settings. These approximations are used in the objective function of the optimization problem to dispatch, rebalance, and occasionally hire idle third-party vehicles in a high-resolution transportation network of Manhattan. The results show that the proposed policy outperforms a reactive optimization approach in a variety of vehicle availability scenarios while hiring fewer vehicles. Moreover, we demonstrate that mobility services can offer strict service level contracts (SLCs) to different user groups featuring both delay and rejection penalties. |
| Reference: | A learning-based optimization approach for autonomous ridesharing platforms with service level contracts and on-demand hiring of idle vehicles. B.A. Beirigo, F. Schulte, R.R. Negenborn. Transportation Science, 2021. | | Request: | A
copy of this publication. |
|
|