Timetable-Based Transit Assignment Using Branch and Bound Techniques
Timetable-Based Transit Assignment Using Branch and Bound Techniques
复制标题
DOI：
10.3141/1752-14
复制
发表时间：
2001
影响因子：
1.7
通讯作者：
Markus Friedrich;I. Hofsäß;S. Wekeck
中科院分区：
文献类型：
--
作者：
Markus Friedrich;I. Hofsäß;S. Wekeck
运输分配程序需要反映线路路线和时刻表施加的限制。它们需要特定的搜索算法，以考虑公交线路之间的换乘及其精确的换乘时间。提出了一种基于时刻表搜索算法的公交网络分配方法。与使用最短路径算法的现有基于时间表的搜索方法不同，所描述的过程使用分支和界限技术来构建连接。这种方法大大减少了计算时间，从而促进了基于时间表的分配在大型网络中的使用。同时，在速度慢但价格便宜或直接连接与更昂贵或需要传输的快速连接竞争的情况下，它会产生更好的结果。
Transit assignment procedures need to reflect the constraints imposed by line routes and timetables. They require specific search algorithms that consider transfers between transit lines with their precise transfer times. Such an assignment procedure is presented for transit networks using a timetable-based search algorithm. In contrast to existing timetable-based search methods employing a shortest-path algorithm, the described procedure constructs connections using branch and bound techniques. This approach significantly reduces computing time, thus facilitating the use of timetable-based assignment for large networks. At the same time, it produces better results in cases where slow but cheap or direct connections compete with fast connections that are more expensive or require transfers.