Home

Multi-dimensional spatiotemporal demand forecasting and service vehicle dispatching for online car-hailing platforms

Download Link
https://econpapers.repec.org/scripts/redir.pf?u=http%3A%2F%2Fhdl.handle.net%2F10.1080%2F00207543.2021.1871675;h=repec:taf:tprsxx:v:60:y:2022:i:6:p:1832-1853
Time Added
5/11/2022, 12:06:20 PM
Search
Machine Learning
Total Downloads
0
Authors
Yuhan Guo Yu Zhang Youssef Boulaksil and Ning Tian
Abstract
Forecasting transportation demands can aid online car-hailing platforms to dispatch their service vehicles in advance to areas with more potential orders. This results in a reduction in passengers’ waiting time and better utilisation of transportation resources. However the complexity and dynamics of multi-dimensional influential factors make the forecasting and dispatching procedures challenging. This paper addresses these issues by using machine learning techniques and an effective probabilistic dispatching strategy. Multiple influential factors were identified in spatial temporal and meteorological dimensions and effective machine learning algorithms were applied to predict the number of passenger orders. The fusion of the multi-dimensional features enables the proposed algorithms to better reveal the spatiotemporal characteristics and their correlations. A sensing-area-based strategy was introduced to dispatch available service vehicles to high demand-intensity regions efficiently with respect to the global demand-supply-balance and the individual probability of receiving orders. Finally extensive experiments with large-scale real-world datasets were conducted to evaluate the performance of the machine learning algorithms and the effectiveness of the dispatching strategy. Overall this paper extensively studies the forecasting of the spatiotemporal demand in multiple cities using point-of-interest data and the dispatching of available service vehicles based on such informa
Keywords
Empty
Year Published
2022
Series
International Journal of Production Research 2022 vol. 60 issue 6 1832-1853
Rank
0.7313466648333334
TOP