具有真实迁移的时间表网络的收缩
Contraction of Timetable Networks with Realistic Transfers
摘要：
我们成功地将时间表网络与现实的转移时间联系起来。收缩逐渐从图中删除节点，并添加快捷方式以保留最短路径。这将查询时间减少到1毫秒，所有测试实例的预处理时间约为6分钟。我们通过改进的收缩算法和使用站图模型来实现这一点。我们图中的每个节点都与一个站点一一对应，每条边都有一个指定的连接集合。我们的图模型不需要平行边。查询算法不计算单个最早到达车站的时间，而是计算允许最佳换乘机会的一组到达连接。
英文摘要：
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This reduces query times to 1 ms with preprocessing times around 6 minutes on all tested instances. We achieve this by an improved contraction algorithm and by using a station graph model. Every node in our graph has a one-to-one correspondence to a station and every edge has an assigned collection of connections. Our graph model does not need parallel edges. The query algorithm does not compute a single earliest arrival time at a station but a set of arriving connections that allow best transfer opportunities.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
