提出新方法,让公交系统实时确认预约车次并持续优化路线,提升服务量。
Dynamic Vehicle Routing Problem with Prompt Confirmation of Advance Requests
- 结合快速插入与任意时间算法,实现即时确认和持续优化
- 强化学习训练目标函数,使服务率提升32%以上
- 适合需实时响应的按需公交系统使用
提供按需出行服务的交通机构需实时处理乘客的出行请求,涉及带接送约束的动态车辆路径问题。我们发现现有研究未解决一个现实问题:当乘客提前数小时预订行程时,机构需快速确认是否可接受请求,并确保已接受请求能如期完成。当前先进方法要么能快速确认但无法持续优化路线,要么能持续优化却无法保证所有已接受请求都能被满足。为此,我们提出一种新型动态车辆路径问题,融合快速插入搜索以实现即时确认,以及任意时间算法进行持续优化。为最大化服务请求数量,我们采用强化学习训练非短视的目标函数,引导插入与任意时间算法向全局最优解演进。在美国内一个真实微公交数据集上的实验表明,该方法既能及时确认请求,又显著提高服务请求数量,相较现有方法提升32%以上。
原文摘要 · Abstract (English)
Transit agencies that operate on-demand transportation services have to respond to trip requests from passengers in real time, which involves solving dynamic vehicle routing problems with pick-up and drop-off constraints. Based on discussions with public transit agencies, we observe a real-world problem that is not addressed by prior work: when trips are booked in advance (e.g., trip requests arrive a few hours in advance of their requested pick-up times), the agency needs to promptly confirm whether a request can be accepted or not, and ensure that accepted requests are served as promised. State-of-the-art computational approaches either provide prompt confirmation but lack the ability to continually optimize and improve routes for accepted requests, or they provide continual optimization but cannot guarantee serving all accepted requests. To address this gap, we introduce a novel problem formulation of dynamic vehicle routing with prompt confirmation and continual optimization. We propose a novel computational approach for this vehicle routing problem, which integrates a quick insertion search for prompt confirmation with an anytime algorithm for continual optimization. To maximize the number requests served, we train a non-myopic objective function using reinforcement learning, which guides both the insertion and the anytime algorithms towards optimal, non-myopic solutions. We evaluate our computational approach on a real-world microtransit dataset from a public transit agency in the U.S., demonstrating that our proposed approach provides prompt confirmation while significantly increasing the number of requests served compared to existing approaches.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。