用图神经网络和强化学习优化城市出租车调度,显著降低等车时间和行驶距离。
Traffic-Aware Optimal Taxi Placement Using Graph Neural Network-Based Reinforcement Learning
- 构建道路图为图结构,结合历史需求与实时交通数据进行建模
- 相比随机调度,等车时间减少56%,司机行程缩短38%
- 适合智慧城市建设者、交通规划者及出行平台技术团队
在智慧城市交通背景下,高效匹配出租车供给与乘客需求需实时融合交通网络数据与出行模式。传统热点预测模型仅依赖历史需求,忽略拥堵、事故和公共事件等动态因素。本文提出一种基于图神经网络的强化学习框架,实现城市环境中出租车最优部署。将城市道路网建模为图,交叉路口为节点,路段为边,节点属性包含历史需求、事件距离和实时拥堵指数(来自实时交通接口)。利用图神经网络编码时空依赖关系,由Q-learning代理推荐最优出租车聚集点。奖励机制同时优化乘客等待时间、司机行驶距离与拥堵规避。在基于德里真实地理边界和历史叫车数据生成的模拟数据集上实验表明,相比基线随机选择方法,本模型使乘客等待时间降低约56%,行驶距离减少38%。该方法可扩展至多模式交通系统,并集成至智慧城市场景中实现实时交通优化。
原文摘要 · Abstract (English)
In the context of smart city transportation, efficient matching of taxi supply with passenger demand requires real-time integration of urban traffic network data and mobility patterns. Conventional taxi hotspot prediction models often rely solely on historical demand, overlooking dynamic influences such as traffic congestion, road incidents, and public events. This paper presents a traffic-aware, graph-based reinforcement learning (RL) framework for optimal taxi placement in metropolitan environments. The urban road network is modeled as a graph where intersections represent nodes, road segments serve as edges, and node attributes capture historical demand, event proximity, and real-time congestion scores obtained from live traffic APIs. Graph Neural Network (GNN) embeddings are employed to encode spatial-temporal dependencies within the traffic network, which are then used by a Q-learning agent to recommend optimal taxi hotspots. The reward mechanism jointly optimizes passenger waiting time, driver travel distance, and congestion avoidance. Experiments on a simulated Delhi taxi dataset, generated using real geospatial boundaries and historic ride-hailing request patterns, demonstrate that the proposed model reduced passenger waiting time by about 56% and reduced travel distance by 38% compared to baseline stochastic selection. The proposed approach is adaptable to multi-modal transport systems and can be integrated into smart city platforms for real-time urban mobility optimization.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。