arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.03574math.OCcs.LG
收藏

面向可扩展实时铁路重调度的范围限制:一项探索性研究

Scope Restriction for Scalable Real-Time Railway Rescheduling: An Exploratory Study

Swiss Federal Railways(瑞士联邦铁路公司)

Erik Nygren, Christian Eichenberger, Emma Frejinger

AI总结:

该探索性研究针对铁路重调度问题,提出按受扰动影响需调整的列车在时空维度限制求解范围的思路,通过Flatland仿真验证了潜力与挑战,并开源了相关实验平台。

摘要:

为激发未来研究,本文介绍了一项针对铁路重调度问题的探索性研究。现有实践与前沿方法中广泛采用的思路是按地理范围分解这类复杂问题。与之不同,本文提出定义一个核心问题:针对扰动事件,将重调度问题的处理范围限制为仅涉及需要重调度的列车,从而在时间与空间两个维度上限制求解范围。该思路的难点在于定义一个范围确定器(scoper),使其能够预测受给定扰动影响的列车服务子集。本文利用Flatland仿真环境得到的初步结果,凸显了这一思路的潜力与挑战。此外,本文还提供了一个基于Flatland铁路环境与Answer-Set Programming(回答集编程)的可扩展开源实验平台实现。

英文摘要:

With the aim to stimulate future research, we describe an exploratory study of a railway rescheduling problem. A widely used approach in practice and state of the art is to decompose these complex problems by geographical scope. Instead, we propose defining a core problem that restricts a rescheduling problem in response to a disturbance to only trains that need to be rescheduled, hence restricting the scope in both time and space. In this context, the difficulty resides in defining a scoper that can predict a subset of train services that will be affected by a given disturbance. We report preliminary results using the Flatland simulation environment that highlights the potential and challenges of this idea. We provide an extensible playground open-source implementation based on the Flatland railway environment and Answer-Set Programming.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑