System and method for computing rail car switching solutions by assessing space availability in a classification track on the basis of block pull time

• US 7,747,362 B2
• Filed: 03/23/2006
• Issued: 06/29/2010
• Est. Priority Date: 12/30/2005
• Status: Active Grant

• Current Assignee: Canadian National Railway Company
• Original Assignee: Canadian National Railway Company
• Inventors: Morency, Vincent, Pathak, Anshu, Doyle, Gordon, Muinonen, Kari, Barker, Matthew
• Primary Examiner(s): Keith; Jack W.
• Assistant Examiner(s): Nguyen; Chuong P
• Application Number:
  US11/387,297
• Publication Number:
  US 20070156299A1
• Time in Patent Office: 1,559 Days
• Field of Search: 701/1, 701/19, 246/2.R, 246/167, 246/176, 246/182, 246/219, 246/220, 705/7, 705/8, 104/26.1
• US Class Current: 701/19
• CPC Class Codes: B61L 17/00 Switching systems for classification yards

Abstract

A system for computing car switching solutions in a railway switch yard. The system is computer based and has an input for receiving data conveying information about one or more arrival trains arriving at the switch yard and data conveying information about departure trains to depart the switch yard. A processing entity processes the data and computes car switching solutions for the railcars.

Claims

1. A method for computing car switching solutions in a railway switchyard containing a switch and a plurality of classification tracks, wherein a first classification track of the plurality of classification tracks holds a first train block, said method comprising:

a) providing a data processing apparatus having an input and an output, the data processing apparatus being programmed with software to compute car switching solutions and perform determination of available space in a classification track;

b) applying at the input of the data processing apparatus first data conveying information related to a pull time of the first train block, the pull time being indicative of a time at which cars of the first train block are expected to vacate the first classification track;

c) determining with the data processing apparatus if space exists in the first classification track to receive cars that belong to a second train block, the data processing apparatus processing the first data to perform the determining, wherein the first and the second train blocks belong to different departure trains;

d) computing with the data processing apparatus a switching solution for cars that belong to the second train block, the computing generating a switching solution directing cars of the second train block in the first classification track at the condition that the determining establishes that enough space exists in the first classification track to receive cars that belong to the second train block; and

e) releasing at the output of the data processing apparatus second data conveying the switching solution.

2. A method as defined in claim 1, wherein the computing generating a switching solution directing cars of the second train block in the first classification track at the condition that the determining establishes that enough space would exists in the first classification track to receive the second train block in its entirety when the last car of the second train block would be switched by the switch.

3. A method as defined in claim 1, wherein the computing generating a switching solution directing cars of the second train block in a classification track other than the first classification track when the determining establishes that not enough space would exist in the first classification track to receive the second train block in its entirety, when the last car of the second train block would be switched by the switch.

6. A method for computing car switching solutions as defined in claim 1, including applying at the input third data, the third data being indicative of an ETA of a car at the railway switchyard that belongs to the second train block.

7. A method for computing car switching solutions as defined in claim 6, including processing the third data with the data processing apparatus in performing the determining.

8. A method for computing car switching solutions as defined in claim 1, including applying at the input fourth data, the fourth data conveying arrival profile information with relation to the second train block.

9. A method for computing car switching solutions as defined in claim 8, wherein the fourth data conveys a rate of arrival of cars of the second train block with relation to time.

10. A method for computing car switching solutions as defined in claim 8, including processing the fourth data with the data processing apparatus in performing the determining.

11. A method as defined in claim 1, wherein the railway switch yard includes a switching queue, the method including computing multiple times with the data processing apparatus a switching solution for a car of the second train block as the car of the second train block progresses through the switching queue.

12. A method as defined in claim 1, wherein the railway switch yard is a hump yard.

13. A method as defined in claim 1, wherein the railway switch yard is a flat yard.

4. A method for computing car switching solutions, including computing with the data processing apparatus an expected switch time in relation to a car of the second train block, the expected switch time indicating approximately when the car is expected to be at the switch.

5. A method for computing car switching solutions as defined in claim 4, wherein the data processing apparatus using the computed expected switch time to perform the determining.