Modeling Network Transition Constraints with Hypergraphs

    Research output: Contribution to journalJournal articlepeer-review

    Abstract

    Discrete time dynamic graphs are frequently used to model multicommodity flows or activity paths through constrained resources, but simple graphs fail to capture the interaction effects of resource transitions. The resulting schedules are not operationally feasible, and return inflated objective values. A directed hypergraph formulation is derived to address railway network sequencing constraints, and an experimental problem sample solved to estimate the magnitude of objective inflation when interaction effects are ignored. The model is used to demonstrate the value of advance scheduling of train paths on a busy North American railway.
    Original languageEnglish
    JournalTransportation Science
    Volume45
    Issue number1
    Pages (from-to)81-97
    ISSN0041-1655
    DOIs
    Publication statusPublished - 2011

    Keywords

    • Transportation
    • Directed hypergraphs
    • Discrete networks
    • Railway scheduling
    • Constrained resources
    • Discrete time dynamics
    • Experimental problems
    • Hyper graph
    • Interaction effect
    • Modeling networks
    • Multi-commodity flow
    • North American
    • Railway network
    • Railroads
    • Scheduling
    • Graph theory
    • OPERATIONS
    • TRANSPORTATION
    • TRAIN TIMETABLING PROBLEM
    • TRAFFIC ASSIGNMENT
    • RAILWAY
    • directed hypergraphs
    • discrete networks
    • railway scheduling
    • RAILROADS

    Fingerprint

    Dive into the research topics of 'Modeling Network Transition Constraints with Hypergraphs'. Together they form a unique fingerprint.

    Cite this