A Set Packing Inspired Method for Real-Time Junction Train Routing

Richard Martin Lusby, Jesper Larsen, Matthias Ehrgott, David Ryan

    Research output: Book/ReportReport

    276 Downloads (Pure)

    Abstract

    Efficiently coordinating the often large number of interdependent, timetabled train movements on a railway junction, while satisfying a number of operational requirements, is one of the most important problems faced by a railway company. The most critical variant of the problem arises on a daily basis at major railway junctions where disruptions to rail traffi c make the planned schedule/routing infeasible and rolling stock planners are forced to reschedule/re-route trains in order to recover feasibility. The dynamic nature of the problem means that good solutions must be obtained quickly. In this paper we describe a set packing inspired formulation of this problem and develop a branch-and-price based solution approach. A real life test instance arising in Germany and supplied by the major German railway company, Deutsche Bahn, indicates the efficiency of the proposed approach by confirming that practical problems can be solved to within a few percent of optimality in reasonable time.
    Original languageEnglish
    Place of PublicationKgs. Lyngby
    PublisherDTU Management
    Number of pages22
    ISBN (Print)978-87-90855-59-8
    Publication statusPublished - 2009
    SeriesDTU Management 2009
    Number15

    Keywords

    • disruption management
    • train routing
    • optimization
    • duality

    Fingerprint Dive into the research topics of 'A Set Packing Inspired Method for Real-Time Junction Train Routing'. Together they form a unique fingerprint.

    Cite this