论文标题
使用混合答案集编程的火车安排
Train Scheduling with Hybrid Answer Set Programming
论文作者
论文摘要
我们提出了基于答案集编程（ASP）的现实世界火车调度问题的解决方案，涉及路由，调度和优化。为此，我们采用一种混合方法，该方法扩展了ASP，并具有差异约束，以解释细粒度的时机。更确切地说，我们示例性地展示了如何使用混合ASP系统Clingo [DL]来解决苛刻的计划和安排问题。特别是，我们研究了如何通过结合不同的ASP解决技术（例如近似和启发式方法）以及用于应对大型现实的火车调度实例的预处理和编码技术来提高性能。在逻辑编程理论和实践中的考虑（TPLP）
We present a solution to real-world train scheduling problems, involving routing, scheduling, and optimization, based on Answer Set Programming (ASP). To this end, we pursue a hybrid approach that extends ASP with difference constraints to account for a fine-grained timing. More precisely, we exemplarily show how the hybrid ASP system clingo[DL] can be used to tackle demanding planning-and-scheduling problems. In particular, we investigate how to boost performance by combining distinct ASP solving techniques, such as approximations and heuristics, with preprocessing and encoding techniques for tackling large-scale, real-world train scheduling instances. Under consideration in Theory and Practice of Logic Programming (TPLP)
