实时动态重规划公交路线，减少延误导致的行程时间
Dynamic Replanning for Improved Public Transport Routing
- 提出主动推送与手动请求两种动态重规划方法
- 推送模式比请求模式显著缩短到达时间
- 适合关注准点率与行程效率的通勤者
公共交通延误普遍存在，常导致出行时间延长和换乘错过。现有解决方案有限：基于历史数据的备用计划错失提前抵达机会，而快照式规划虽考虑当前延误却忽略未来变化。随着实时延误数据日益可得，用户可实时调整行程。然而，现有研究缺乏能充分利用这一优势的系统级动态重规划框架。为此，本文形式化了公共交通路径的动态重规划问题，提出两种方案：一种为用户手动请求的“拉取”模式，另一种为服务器主动监控并调整行程的“推送”新模式。实验表明，推送模式优于拉取模式，显著提升效率。结果还显示，动态重规划可带来可观的到达时间节省。
原文摘要 · Abstract (English)
Delays in public transport are common, often impacting users through prolonged travel times and missed transfers. Existing solutions for handling delays remain limited; backup plans based on historical data miss opportunities for earlier arrivals, while snapshot planning accounts for current delays but not future ones. With the growing availability of live delay data, users can adjust their journeys in real-time. However, the literature lacks a framework that fully exploits this advantage for system-scale dynamic replanning. To address this, we formalise the dynamic replanning problem in public transport routing and propose two solutions: a "pull" approach, where users manually request replanning, and a novel "push" approach, where the server proactively monitors and adjusts journeys. Our experiments show that the push approach outperforms the pull approach, achieving significant speedups. The results also reveal substantial arrival time savings enabled by dynamic replanning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。