First Region Last Route Recommendation via Graph Attention Network for Taxis

ABSTRACT Taxi passenger‐seeking recommendation can effectively improve driver profit and reduce fuel consumption. Existing methods always directly recommend passenger‐seeking regions or passenger‐seeking routes. However, these methods still face a threefold challenge of data sparseness, local optimization, and low efficiency. Therefore, we propose a novel model of first region last route recommendation via graph attention network for taxis , named FRLR‐GAT . Firstly, an offline‐online (O2O) model based on extreme deep factorization machine (xDeepFM) is put forward for passenger‐seeking region recommendation because xDeepFM has strong sparseness resistance. A larger grid with the highest pick‐up probability is recommended offline to avoid falling into local optimization. In the larger one, a smaller grid is further provided online. Secondly, a graph attention network (GAT) based route recommendation model is presented to online provide passenger‐seeking routes in the smaller grid, so that the proposed model obtains higher efficiency. Experiments on multi‐source datasets show that compared with some existing state‐of‐the‐art methods, FRLR‐GAT is able to respectively reduce the mean cruising distance and the average cruising time by at least 19% and 22%, while the average recommendation time is only 92 ms.

Authors

Institutions

Publication Details

Journal
Transactions in GIS
Published
2025-10-28
DOI
https://doi.org/10.1111/tgis.70142
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

First Region Last Route Recommendation via Graph Attention Network for Taxis

Zhixiong Fang, Yijiang Zhao, Decheng Zhang, Jiaqi Fan et al.
Transactions in GIS
Transportation and Mobility Innovations
article

First Region Last Route Recommendation via Graph Attention Network for Taxis

Zhixiong Fang, Yijiang Zhao, Decheng Zhang, Jiaqi Fan, Yizhi Liu
article en

Abstract

ABSTRACT Taxi passenger‐seeking recommendation can effectively improve driver profit and reduce fuel consumption. Existing methods always directly recommend passenger‐seeking regions or passenger‐seeking routes. However, these methods still face a threefold challenge of data sparseness, local optimization, and low efficiency. Therefore, we propose a novel model of first region last route recommendation via graph attention network for taxis , named FRLR‐GAT . Firstly, an offline‐online (O2O) model based on extreme deep factorization machine (xDeepFM) is put forward for passenger‐seeking region recommendation because xDeepFM has strong sparseness resistance. A larger grid with the highest pick‐up probability is recommended offline to avoid falling into local optimization. In the larger one, a smaller grid is further provided online. Secondly, a graph attention network (GAT) based route recommendation model is presented to online provide passenger‐seeking routes in the smaller grid, so that the proposed model obtains higher efficiency. Experiments on multi‐source datasets show that compared with some existing state‐of‐the‐art methods, FRLR‐GAT is able to respectively reduce the mean cruising distance and the average cruising time by at least 19% and 22%, while the average recommendation time is only 92 ms.

Transactions in GISVol. 29(7)
Hunan University of Science and Technology (CN), Shenzhen Institute of Information Technology (CN), Xiangyang Central Hospital (CN)
Openalex Percentile: Top 66%
Transportation and Mobility Innovations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.