按需多式联运系统的换乘扩展图
Transfer-Expanded Graphs for On-Demand Multimodal Transit Systems
摘要:
本文研究了按需多式联运系统(ODMTS)的网络设计问题。ODMTS由一系列由高频巴士服务的枢纽组成,乘客通过按需穿梭巴士连接到枢纽,这些穿梭巴士服务于第一英里和最后一英里。本文概括了以前的工作,包括三个额外的要素,在实践中是至关重要的。首先,在整个网络中允许不同的频率。第二,其他过境方式(例如,铁路)。第三,限制每位乘客的换乘次数。添加一个约束来限制传输的数量对现有的Benders分解方法有显着的负面影响,因为它在子问题中引入了非凸性。相反,本文通过转移扩展图来实施限制,即,分层图,其中每一层对应于一定数量的传输。现实世界的案例研究,广义ODMTS设计问题解决了亚特兰大市。结果表明,利用问题的结构,通过转移扩展图的结果在显着的计算改进。
英文摘要:
This paper considers a generalization of the network design problem for On-Demand Multimodal Transit Systems (ODMTS). An ODMTS consists of a selection of hubs served by high frequency buses, and passengers are connected to the hubs by on-demand shuttles which serve the first and last miles. This paper generalizes prior work by including three additional elements that are critical in practice. First, different frequencies are allowed throughout the network. Second, additional modes of transit (e.g., rail) are included. Third, a limit on the number of transfers per passenger is introduced. Adding a constraint to limit the number of transfers has a significant negative impact on existing Benders decomposition approaches as it introduces non-convexity in the subproblem. Instead, this paper enforces the limit through transfer-expanded graphs, i.e., layered graphs in which each layer corresponds to a certain number of transfers. A real-world case study is presented for which the generalized ODMTS design problem is solved for the city of Atlanta. The results demonstrate that exploiting the problem structure through transfer-expanded graphs results in significant computational improvements.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。