To realize the benefits of network connectivity in transfer-based transit networks, it is critical to minimize transfer disutility for passengers by synchronizing timetables of intersecting routes. We propose a mixed-integer linear programming timetable synchronization model that incorporates new features, such as dwell time determination and vehicle capacity consideration, which have been largely overlooked in the literature at the scheduling stage. We introduce a new concept of pre-planned holding time, called transfer buffer time, to reduce the transfer waiting time, particularly for transfers to low-frequency routes, while taking into account the penalty of extra in-vehicle time for onboard passengers and the possible consequences on headway regularity of a route. We develop a Lagrangian relaxation-based heuristic to obtain high-quality solutions efficiently for large instances. Our experiments on instances with up to 12 transfer nodes in the City of Toronto, with a mixture of low- and high-frequency routes, illustrate the potential benefits of the proposed model over the state of the art. The results indicate that incorporating transfer buffer time, dwell time determination, and vehicle capacity consideration improves model outcomes considerably, also demonstrating the computational efficiency of our Lagrangian-based solution method.

中文翻译：

---

公交网络中传输同步的新模型和基于拉格朗日的启发式求解方法

为了在基于换乘的交通网络中实现网络连接的优势，通过同步相交路线的时间表来最大限度地减少乘客的换乘负效用至关重要。我们提出了一种混合整数线性规划时间表同步模型，该模型结合了新功能，例如停留时间确定和车辆容量考虑，这些在调度阶段的文献中很大程度上被忽视了。我们引入了预先计划等待时间的新概念，称为转乘缓冲时间，以减少转乘等待时间，特别是对于低频航线的转乘，同时考虑到机上乘客额外在车时间的损失以及对路线的车头时距规律性可能产生的影响。我们开发了一种基于拉格朗日松弛的启发式方法，可以为大型实例高效地获得高质量的解决方案。我们在多伦多市拥有多达 12 个传输节点的实例上进行了实验，其中混合了低频和高频路线，说明了所提出的模型相对于现有技术的潜在优势。结果表明，结合传输缓冲时间、停留时间确定和车辆容量考虑可显着改善模型结果，也证明了我们基于拉格朗日的求解方法的计算效率。