TRIPS体系结构
邻接表
图形
计算机科学
邻接矩阵
运筹学
理论计算机科学
数学
算法
并行计算
作者
Chunyan Shuai,Xiaoqi Zhang,Yuxiang Wang,Mingwei He,Fang Yang,Xu Geng
出处
期刊:IEEE Intelligent Transportation Systems Magazine
[Institute of Electrical and Electronics Engineers]
日期:2023-07-01
卷期号:15 (4): 121-136
被引量:9
标识
DOI:10.1109/mits.2023.3244935
摘要
Online car-hailing has become an indispensable transportation means for residents. The short-term origin and destination (OD) prediction of online car-hailing trips is conducive to understanding the inflow and outflow of online car-hailing trips in a region and provides data support for the delivery and scheduling of vehicles. Accordingly, this article takes the data of car-hailing trips in the central area of Haikou, China, as the research data; makes an in-depth analysis of the regularities of car-hailing trips; and divides the central area of Haikou into 84 grids with a length of 3 km. This article constructs three adjacency matrices, Am01, Sam, and Amn, to reflect the complex spatial relationships of the OD matrixes of online car-hailing from different perspectives. Then, a model, based on the graph convolutional network (GCN) and gated recurrent unit, denoted as the temporal GCN ( T-GCN ), is introduced for the grid-based short-term OD prediction. The case study in Haikou shows that T-GCNs based on the three adjacency matrices are better than other models, wherein the Amn-based T-GCN is more consistent with the OD flows’ spatial relationship, achieves the best prediction performance, and shows that there exists a proportional relationship between flows on different OD pairs. The application of the research results is beneficial for the car-hailing platform to perform the dynamic scheduling of vehicles in advance, further improving the operating efficiency and reducing the waiting time of passengers so as to effectively alleviate the problem of the imbalance between the supply and demand of online car-hailing travel.
科研通智能强力驱动
Strongly Powered by AbleSci AI