We study a tactical level crew capacity planning problem in railways which determines the minimum required crew size in a region while both feasibility and connectivity of schedules are maintained. We present alternative mathematical formulations which depend on network representations of the problem. A path-based formulation in the form of a set-covering problem along with a column-and-row generation algorithm is proposed. An arc-based formulation of the problem is solved with a commercial linear programming solver. The computational study illustrates the effect of schedule connectivity on crew capacity decisions and shows that arc-based formulation is a viable approach.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Railway crew capacity planning problem with connectivity of schedules




    Publication date :

    2015




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    Heuristic for Railway Crew Scheduling With Connectivity of Schedules

    Bansal, Akshat / Anoop, Kezhe Perumpadappu / Rangaraj, Narayan | Transportation Research Record | 2024


    Tactical Planning of Public Transport Services: Vehicle and Crew Schedules

    Gkiotsalitis, Konstantinos | Springer Verlag | 2023



    Strategic Planning of Depots for a Railway Crew Scheduling Problem

    Scheffler, Martin | British Library Conference Proceedings | 2019


    Increasing stability of crew and aircraft schedules

    Dück, Viktor | Online Contents | 2012