Modeling Single Track Railway Scheduling Problem with Two Stations in Answer Set Programming

Answer set programming (ASP) is a new programming language paradigm combining the declarative aspect with non-monotonic reasoning. ASP allows, using the concept of negation as failure, to handle problems with default knowledge and produce nonmonotonic reasoning. In this paper, we present an approach to solve an application of Two Stations Single Track Railway Scheduling Problem in Answer Set Programming. The problem is a highly combinatorial and is generally solved by specific programs. We present an approach to solve the two stations single track railway scheduling problem in Answer Set Programming. It turns out that, Answer Set Programming greatly simplifies the problem statement and generates optimized schedule of either completion time or tardiness.