Scheduling method and system for rail networks

• US 20050261946A1
• Filed: 05/20/2003
• Published: 11/24/2005
• Est. Priority Date: 05/20/2002
• Status: Active Grant

• Current Assignee: TTG Limited (TUI AG)
• Original Assignee: Ausrail Technologies Pty., Limited
• Inventors: Howlett, Philip George, Pudney, Peter John
• Granted Patent: US 7,428,452 B2
• Time in Patent Office: Days
• US Class Current: 705/8
• CPC Class Codes: B61L 27/12 Preparing schedules
• CPC Class Codes: G06Q 10/06312 Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
• CPC Class Codes: G09D 1/00 Railway or like time or fare tables; Indicating or reading aids therefor essentially incorporating maps or route diagrams G09B; railway routing charts G09B; display devices, e.g. railway indicator boards G09F

Abstract

The present invention provides a method and system for calculating a plan for moving trains on a network that reduces the cost of delays or late running. The invention is useful for timetable development, for real-time dynamic rescheduling of the trains on a network, and for assessing proposed changes to network infrastructure. A method of moving a given set of trains from their respective origins to their respective destinations, said method comprising the steps of: (i) form a schedulable set of trains consisting of all trains not at their destination that have at least one unoccupied link; (ii) from this schedulable set select the train with the earliest start time from its current location, wherein this selected train is travelling from station S_i to station S_j; (iii) form a contender set of trains consisting of all trains that have as their next move a dispatch from station S_i to S_j and vice-versa; (iv) from this contender set select the train with the earliest arrival time at its successor station (either station S_i to S_j); (v) for the selected train invoke a deadlock avoidance procedure wherein if this procedure accepts the train then go on to step (iv), or if the train is rejected then remove it from the schedulable set, and if the schedulable set is not empty then return to step (ii) other vise go to step (vii); (vi) schedule the selected train over its chosen link to its successor; and (vii) return to step (i) until all trains are at their destination or the schedulable set is empty.

Claims

1. A method of moving a given set of trains from their respective origins to their respective destinations, said method comprising the steps of:

(i) form a schedulable set of trains consisting of all trains not at their destination that have at least one unoccupied link;

(ii) from this schedulable set select the train with the earliest start time from its current location, wherein this selected train is travelling from station S_i to station S_j;

(iii) form a contender set of trains consisting of all trains that have as their next move a dispatch from station S_i to S_j and vice-versa;

(iv) from this contender set select the train with the earliest arrival time at its successor station (either station S_i to S_j);

(v) for the selected train invoke a deadlock avoidance procedure wherein if this procedure accepts the train then go on to step (iv), or if the train is rejected then remove it from the schedulable set, and if the schedulable set is not empty then return to step (ii) otherwise go to step (vii);

(vi) schedule the selected train over its chosen link to its successor station; and

(vii) return to step (i) until all trains are at their destination or the schedulable set is empty.