This study develops an innovative model for inferring optimal proactive relocation strategy for empty vehicles of on-demand mobility service (OMS) directly from past observations of passenger demand. The output of our model is a row stochastic relocation matrix which gives the probability that an empty vehicle should be relocated from location i to location j at any given time. The matrix itself is high-dimensional and therefore challenging to obtain accurate estimation with traditional machine learning approach. Our model proposes the low-rank approximation of the relocation matrix, and introduces the deep convolution-LSTM network which extracts low-level spatial and temporal features from past demand observations for best restoration of the actual low-rank approximation vector. The model is trained by deriving the optimal matching strategies from one year of real-world trip data. The results show that our model is able to predict the low-rank approximation of the relocation matrix with 4% of mean absolute error, may reduce the relocation cost by 20%-45% as compared to the real-world observations and is 50% optimal as compared to the global optimal matching with perfect information.
Optimal Proactive Vehicle Relocation for On-Demand Mobility Service with Deep Convolution-LSTM Network
2019-10-01
2091127 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Dynamic Optimal Vehicle Relocation in Carshare Systems
Transportation Research Record | 2016
|