Train Scheduling with Hybrid Answer Set Programming
Abstract
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)
Cite
@article{arxiv.2003.08598,
title = {Train Scheduling with Hybrid Answer Set Programming},
author = {Dirk Abels and Julian Jordi and Max Ostrowski and Torsten Schaub and Ambra Toletti and Philipp Wanko},
journal= {arXiv preprint arXiv:2003.08598},
year = {2021}
}
Comments
Under consideration in Theory and Practice of Logic Programming (TPLP)