Joint predictions of multi-modal ride-hailing demands: A deep multi-task multi-graph learning-based approach

被引:70
作者
Ke, Jintao [1 ]
Feng, Siyuan [2 ]
Zhu, Zheng [2 ]
Yang, Hai [2 ]
Ye, Jieping [3 ]
机构
[1] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Civil & Environm Engn, Kowloon, Hong Kong, Peoples R China
[3] Univ Michigan, Dept Computat Med & Bioinformat, Ann Arbor, MI 48109 USA
关键词
Ride-hailing; Demand prediction; Deep multi-task learning; Multi-graph convolutional network; TRAFFIC FLOW PREDICTION; NEURAL-NETWORK; VOLUME; SPEED;
D O I
10.1016/j.trc.2021.103063
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Ride-hailing platforms generally provide various service options to customers, such as solo ride services, shared ride services, etc. It is generally expected that demands for different service modes are correlated, and the prediction of demand for one service mode can benefit from historical observations of demands for other service modes. Moreover, an accurate joint prediction of demands for multiple service modes can help the platforms better allocate and dispatch vehicle resources. Although there is a large stream of literature on ride-hailing demand predictions for one specific service mode, few efforts have been paid towards joint predictions of ride-hailing demands for multiple service modes. To address this issue, we propose a deep multi-task multi graph learning approach, which combines two components: (1) multiple multi-graph convolutional (MGC) networks for predicting demands for different service modes, and (2) multi-task learning modules that enable knowledge sharing across multiple MGC networks. More specifically, two multi-task learning structures are established. The first one is the regularized cross-task learning, which builds cross-task connections among the inputs and outputs of multiple MGC networks. The second one is the multi-linear relationship learning, which imposes a prior tensor normal distribution on the weights of various MGC networks. Although there are no concrete bridges between different MGC networks, the weights of these networks are constrained by each other and subject to a common prior distribution. Evaluated with the for-hire-vehicle datasets in Manhattan, we show that our proposed approach outperforms the benchmark algorithms in prediction accuracy for different ride-hailing modes.
引用
收藏
页数:14
相关论文
共 47 条
[1]  
Ahmed M. S., 1979, Transportation Research Board
[2]  
[Anonymous], 2021, IEEE Trans. Broadcast.
[3]   Predicting real-time surge pricing of ride-sourcing companies [J].
Battifarano, Matthew ;
Qian, Zhen .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2019, 107 :444-462
[4]   Application of the ARIMA models to urban roadway travel time prediction - A case study [J].
Billings, Daniel ;
Jiann-Shiou Yang .
2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, :2529-+
[5]   XGBoost: A Scalable Tree Boosting System [J].
Chen, Tianqi ;
Guestrin, Carlos .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :785-794
[6]  
Defferrard M, 2016, ADV NEUR IN, V29
[7]   Greedy function approximation: A gradient boosting machine [J].
Friedman, JH .
ANNALS OF STATISTICS, 2001, 29 (05) :1189-1232
[8]  
Geng X., 2019, ARXIV PREPRINT ARXIV
[9]  
Geng X, 2019, AAAI CONF ARTIF INTE, P3656
[10]   SHORT-TERM PREDICTION OF TRAFFIC VOLUME IN URBAN ARTERIALS [J].
HAMED, MM ;
ALMASAEID, HR ;
SAID, ZMB .
JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 1995, 121 (03) :249-254