In between transportation services, trains are parked and maintained at shunting yards. The conflict-free routing of trains to and on these yards and the scheduling of service and maintenance tasks is known as the train unit shunting and service problem. Efficient use of the capacity of these yards is becoming increasingly important, because of increasing numbers of trains without proportional extensions of the yards. Efficiently scheduling maintenance activities is extremely challenging: currently only heuristics succeed in finding solutions to the integrated problem at all. Bounds are needed to determine the quality of these heuristics, and also to support investment decisions on increasing the yard capacity. For this, a complete algorithm for a possibly relaxed problem model is required. We analyze the potential of extending the model for multi-agent path finding to be used for such a relaxation.

中文翻译：

---

列车调车与服务：多智能体寻路的现实应用

在运输服务之间，火车停在调车场并进行维护。列车进出这些场的无冲突路线以及服务和维护任务的调度被称为列车单元调车和服务问题。由于越来越多的列车数量没有按比例扩展，因此有效利用这些车场的容量变得越来越重要。有效地安排维护活动极具挑战性：目前只有启发式方法才能成功找到集成问题的解决方案。需要确定这些启发式方法的质量，并支持有关增加堆场容量的投资决策。为此，需要一个可能松弛的问题模型的完整算法。