通过集成延迟管理找到鲁棒的周期时间表
Finding Robust Periodic Timetables by Integrating Delay Management
摘要：
通过对周期事件调度问题（PESP）的扩展，定义并求解了一个求解鲁棒周期时间表的数学模型。为了模拟延迟，而不是名义上的旅行时间已经在调度步骤，我们集成延迟管理到定期调度问题。在分别回顾（PESP）和延迟管理之后，我们引入了一个周期性延迟管理模型，该模型能够评估延迟阻力方面的周期性时间表。在介绍了周期性延迟管理的基础上，我们定义了鲁棒周期性时间表问题（RPT）。由于（RPT）的高复杂性，我们提出了两种不同的简化问题，并介绍解决方案的算法。这些解决方案的算法进行了测试，对时间表发现的标准程序，定期schedulabling相对于其延迟电阻。计算结果表明，我们的算法产生的时间表，可以更好地应付发生的延迟，即使在大规模的数据集和低计算量。
英文摘要：
This paper defines and solves a mathematical model for finding robust periodic timetables by proposing an extension of the Periodic Event Scheduling Problem (PESP). In order to model delayed and not nominal travel times already in the timetabling step, we integrate delay management into the periodic timetabling problem. After revisiting both (PESP) and delay management individually, we introduce a periodic delay management model capable of evaluating periodic timetables with respect to delay resistance. Having introduced periodic delay management, we define the Robust Periodic Timetabling problem (RPT). Due to the high complexity of (RPT) we propose two different simplifications of the problem and introduce solution algorithms for both of them. These solution algorithms are tested against timetables found by standard procedures for periodic timetabling with respect to their delay-resistance. The computational results show that our algorithms yield timetables which can cope better with occurring delays, even on large-scale datasets and with low computational effort.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
