Jiawei Xue
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiawei Xue has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Satish V. Ukkusuri
Lyles School of Civil and Construction Engineering, Purdue University, West Lafayette, USA
8 shared publications - Eunhan Ka
Lyles School of Civil and Construction Engineering, Purdue University, West Lafayette, IN
2 shared publications - Jianzhu Ma
Department of Electronic Engineering, Tsinghua University, Beijing, China
2 shared publications - Takahiro Yabe
Department of Technology Management and Innovation, Tandon School of Engineering, New York University, Brooklyn, USA
2 shared publications - Xiaowei Chen
Lyles School of Civil Engineering, Purdue University, West Lafayette, IN, USA
2 shared publications - Xinwu Qian
Department of Civil and Environmental Engineering, Rice University, Houston, USA
2 shared publications
Latest Publications
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (2) , 851-864
Predicting Individual Irregular Mobility via Web Search-Driven Bipartite Graph Neural Networks
Individual mobility prediction holds significant importance in urban computing, supporting various applications such as place recommendations. Current studies primarily focus on frequent mobility patterns including commuting trips to residential and workplaces. However, such studies do not accurately forecast irregular trips, which incorporate journeys that end at locations other than residences and workplaces. Despite their usefulness in recommendations and advertising, the stochastic, infrequent, and spontaneous nature of irregular trips makes them challenging to predict. To address the difficulty, this study proposes a web search-driven bipartite graph neural network, namely WS-BiGNN, for the individual irregular mobility prediction (IIMP) problem. Specifically, we construct bipartite graphs to represent mobility and web search records, formulating the IIMP problem as a link prediction task. First, WS-BiGNN employs user-user edges and POI-POI edges (POI: point-of-interest) to bolster information propagation within sparse bipartite graphs. Second, the temporal weighting module is created to discern the influence of past mobility and web searches on future mobility. Lastly, WS-BiGNN incorporates the search-mobility memory module, which classifies four interpretable web search-mobility patterns and harnesses them to improve prediction accuracy. We perform experiments utilizing real-world data in Tokyo from October 2019 to March 2020. The results showcase the superior performance of WS-BiGNN compared to baseline models, as supported by higher scores in Recall and NDCG. The exceptional performance and additional analysis reveal that infrequent behavior may be effectively predicted by learning search-mobility patterns at the individual level.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37 (2) , 851-864
Predicting Individual Irregular Mobility via Web Search-Driven Bipartite Graph Neural Networks
Individual mobility prediction holds significant importance in urban computing, supporting various applications such as place recommendations. Current studies primarily focus on frequent mobility patterns including commuting trips to residential and workplaces. However, such studies do not accurately forecast irregular trips, which incorporate journeys that end at locations other than residences and workplaces. Despite their usefulness in recommendations and advertising, the stochastic, infrequent, and spontaneous nature of irregular trips makes them challenging to predict. To address the difficulty, this study proposes a web search-driven bipartite graph neural network, namely WS-BiGNN, for the individual irregular mobility prediction (IIMP) problem. Specifically, we construct bipartite graphs to represent mobility and web search records, formulating the IIMP problem as a link prediction task. First, WS-BiGNN employs user-user edges and POI-POI edges (POI: point-of-interest) to bolster information propagation within sparse bipartite graphs. Second, the temporal weighting module is created to discern the influence of past mobility and web searches on future mobility. Lastly, WS-BiGNN incorporates the search-mobility memory module, which classifies four interpretable web search-mobility patterns and harnesses them to improve prediction accuracy. We perform experiments utilizing real-world data in Tokyo from October 2019 to March 2020. The results showcase the superior performance of WS-BiGNN compared to baseline models, as supported by higher scores in Recall and NDCG. The exceptional performance and additional analysis reveal that infrequent behavior may be effectively predicted by learning search-mobility patterns at the individual level.
- 2 October 2024
- Published by Elsevier in Sustainable Cities and Society
- Vol. 115
An agent-based model of post-disaster recovery in multilayer socio-physical networks
- 2 October 2024
- Published by Elsevier in Sustainable Cities and Society
- Vol. 115
An agent-based model of post-disaster recovery in multilayer socio-physical networks
- 14 June 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 189
Network macroscopic fundamental diagram-informed graph learning for traffic state imputation
- 14 June 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 189
Network macroscopic fundamental diagram-informed graph learning for traffic state imputation
- 24 September 2022
- Published by Elsevier in Transportation Research Part D: Transport and Environment
- Vol. 111, 103447
Online eco-routing for electric vehicles using combinatorial multi-armed bandit with estimated covariance
- 24 September 2022
- Published by Elsevier in Transportation Research Part D: Transport and Environment
- Vol. 111, 103447
Online eco-routing for electric vehicles using combinatorial multi-armed bandit with estimated covariance
- Top Cited Papers
- 23 March 2022
- Published by Springer Nature in Nature Machine Intelligence
- Vol. 4 (3) , 246-257
Quantifying the spatial homogeneity of urban road networks via graph neural networks
- 23 March 2022
- Published by Springer Nature in Nature Machine Intelligence
- Vol. 4 (3) , 246-257
Top Cited PapersQuantifying the spatial homogeneity of urban road networks via graph neural networks
- Open Access
- 20 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Online Energy-optimal Routing for Electric Vehicles with Combinatorial Multi-arm Semi-Bandit
We have seen a rapid growth in the adoption of electric vehicle in today’s commercial mobility service market, from carrying passengers to the delivery of goods. One cardinal issue concerning the operation of EVs is the optimal routing of EV fleets with limited battery capacity. In this study, we investigate the energy-optimal online routing problem for the fleet of EVs, which focuses on identifying real-time minimum electricity consumption paths (MECP) for multiple OD pairs with limited information. We develop a multi-OD combinatorial multi-arm semi-bandit model (MCMAB) that uses the fleet of EVs as sensors in the transportation network and promotes the utilization of common information shared by different OD pairs. We further enrich the model with the path elimination policy to obtain MECP of high confidence while significantly reducing the number of learning iterations and the number of explorations needed. We demonstrate the effectiveness of the MCMAB and the efficiency of the path elimination policy with comprehensive numerical experiments in Manhattan, NYC. The results show that the proposed online routing algorithms can achieve near-optimal MECPs efficiently, and the quality of the solutions is significantly better than using the shortest travel time paths as approximate MECPs.
- 20 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessOnline Energy-optimal Routing for Electric Vehicles with Combinatorial Multi-arm Semi-Bandit
We have seen a rapid growth in the adoption of electric vehicle in today’s commercial mobility service market, from carrying passengers to the delivery of goods. One cardinal issue concerning the operation of EVs is the optimal routing of EV fleets with limited battery capacity. In this study, we investigate the energy-optimal online routing problem for the fleet of EVs, which focuses on identifying real-time minimum electricity consumption paths (MECP) for multiple OD pairs with limited information. We develop a multi-OD combinatorial multi-arm semi-bandit model (MCMAB) that uses the fleet of EVs as sensors in the transportation network and promotes the utilization of common information shared by different OD pairs. We further enrich the model with the path elimination policy to obtain MECP of high confidence while significantly reducing the number of learning iterations and the number of explorations needed. We demonstrate the effectiveness of the MCMAB and the efficiency of the path elimination policy with comprehensive numerical experiments in Manhattan, NYC. The results show that the proposed online routing algorithms can achieve near-optimal MECPs efficiently, and the quality of the solutions is significantly better than using the shortest travel time paths as approximate MECPs.