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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Train scheduling using constraint programming techniques


    Additional title:

    Automatische Erzeugung von Fahrplänen


    Contributors:


    Publication date :

    1993


    Size :

    13 Seiten, 12 Bilder, 10 Quellen



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English






    Road Inspection Scheduling Model Using Constraint Programming

    Wang, Hsi-Sung / Liu, Shu-Shun | Tema Archive | 2013


    Constraint logic programming and scheduling

    Esquirol, P. / Lopez, P. | British Library Online Contents | 1995


    A Constraint-Based Scheduling Model for Optimal Train Dispatching

    Rodriguez, J. / Marliere, G. / Sobieraj, S. et al. | British Library Conference Proceedings | 2010