Many unsuccessful attempts have been made to automatically generate complete time-tables for large suburban rail networks. This paper investigates the use of constraint programming techniques for real-life train scheduling problems. Firstly, the constraints of train scheduling are detailed; secondly, the problem is modelled as a constraint satisfaction problem (CSP) and finally resolution is achieved through the powerful technique of constraint programming. An implementation of the resolution model was written in Charme for the Melbourne rail network, and complete time-tables were successfully generated. The results obtained are discussed and compared with the results derived from more conventional techniques.
Train scheduling using constraint programming techniques
Automatische Erzeugung von Fahrplänen
1993
13 Seiten, 12 Bilder, 10 Quellen
Conference paper
English
A constraint programming model for real-time train scheduling at junctions
Online Contents | 2007
|Road Inspection Scheduling Model Using Constraint Programming
Tema Archive | 2013
|Constraint logic programming and scheduling
British Library Online Contents | 1995
|A Constraint-Based Scheduling Model for Optimal Train Dispatching
British Library Conference Proceedings | 2010
|