Techniques for inserting additional trains into existing timetables

Document Type

Journal Article

Publication Date


Subject Area

operations - scheduling, mode - rail


Trains, Timetables, Schedules and scheduling, Railways, Railroads, Railroad trains, Infrastructure, Algorithms


In this paper techniques for scheduling additional train services (SATS) are considered as is train scheduling involving general time window constraints, fixed operations, maintenance activities and periods of section unavailability. The SATS problem is important because additional services must often be given access to the railway and subsequently integrated into current timetables. The SATS problem therefore considers the competition for railway infrastructure between new services and existing services belonging to the same or different operators. The SATS problem is characterised as a hybrid job shop scheduling problem with time window constraints. To solve this problem constructive algorithm and meta-heuristic scheduling techniques that operate upon a disjunctive graph model of train operations are utilised. From numerical investigations the proposed framework and associated techniques are tested and shown to be effective.


Transportation Research Part B Home Page: