Optimal inter-area coordination of train rescheduling decisions
Optimal inter-area coordination of train rescheduling decisions
复制标题
DOI：
10.1016/j.sbspro.2011.04.508
复制
发表时间：
2011
影响因子：
10.6
通讯作者：
F. Corman;F. Corman;A. D’Ariano;D. Pacciarelli;M. Pranzo
中科院分区：
文献类型：
--
作者：
F. Corman;F. Corman;A. D’Ariano;D. Pacciarelli;M. Pranzo
铁路调度员实时重新调度列车，以限制干扰的传播，并通过最大限度地减少与离线时间表的偏差来调节各自调度区域的交通。然而，在一个领域所做的决定可能会影响到其他领域列车时刻表的质量，甚至是可行性。区域控制中心协调多个区域的调度员的工作，以在全球范围内调节交通，避免全球不可行的情况。与调度员问题不同，区域控制中心的协调活动仍然没有得到充分的研究，即使这种活动是有效交通管理的关键因素。本文研究了多个调度员的协调问题，其目标是使它们的行为趋向全局最优解。在我们的模型中，协调器可以在每个调度区域的边界施加约束。然后，每个调度员必须通过生成符合协调器施加的边界约束的本地可行解决方案来安排其区域内的列车。因此，协调器所面临的问题是一个双层规划问题，其中由协调器控制的变量是边界约束。我们证明了协调器问题可以用分支定界过程求解到最优。该协调算法已在荷兰一个交通繁忙的大型真实铁路网上进行了测试。我们的实验结果表明，在与实时操作兼容的计算时间内，经常可以找到各种网络划分的最佳解决方案。
Railway dispatchers reschedule trains in real-time in order to limit the propagation of disturbances and to regulate traffic in their respective dispatching areas by minimizing the deviation from the off-line timetable. However, the decisions taken in one area may influence the quality and even the feasibility of train schedules in the other areas. Regional control centers coordinate the dispatchers’ work for multiple areas in order to regulate traffic at the global level and to avoid situations of global infeasibility. Differently from the dispatcher problem, the coordination activity of regional control centers is still underinvestigated, even if this activity is a key factor for effective traffic management.This paper studies the problem of coordinating several dispatchers with the objective of driving their behavior towards globally optimal solutions. With our model, a coordinator may impose constraints at the border of each dispatching area. Each dispatcher must then schedule trains in its area by producing a locally feasible solution compliant with the border constraints imposed by the coordinator. The problem faced by the coordinator is therefore a bilevel programming problem in which the variables controlled by the coordinator are the border constraints. We demonstrate that the coordinator problem can be solved to optimality with a branch and bound procedure. The coordination algorithm has been tested on a large real railway network in the Netherlands with busy traffic conditions. Our experimental results show that a proven optimal solution is frequently found for various network divisions within computation times compatible with real-time operations.