System and method for computing rail car switching solutions in a switchyard using an iterative method

• US 7,818,101 B2
• Filed: 03/23/2006
• Issued: 10/19/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
• Assistant Examiner(s): Nguyen; Chuong P
• Application Number:
  US11/387,364
• Publication Number:
  US 20070156301A1
• Time in Patent Office: 1,671 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 switch yard having a plurality of classification tracks, a switch and a switching queue containing a plurality of cars to be sequentially switched by the switch to respective ones of the classification tracks, said method comprising:

a) providing a data processing apparatus having an output, the data processing apparatus being programmed with software to compute car switching solutions;

b) iteratively computing with the software executed by the data processing apparatus a plurality of car switching solution for at least one car in the switching queue as the car progresses through the switching queue toward the switch, the computation of a car switching solution including a selection of a classification track among the plurality of the classification tracks in which the car is to be switched;

c) releasing at the output of the data processing apparatus data conveying at least one of the computed switching solutions.

2. A method for computing car switching solutions as defined in claim 1, including computing with the data processing apparatus an expected switch time for the at least one car, the expected switch time being indicative of an approximate time at which the at least one car is expected at the switch, the data processing apparatus using the computed expected switch time as a factor during the computation of at least one switching solution for the at least one car.

3. A method as defined in claim 1, wherein the at least one car belongs to a train block, the method including computing with the data processing apparatus available space in several classification tracks of the plurality of classification tracks to receive cars that belong to the train block.

4. A method as defined in claim 3, including computing at least one of the car switching solutions with the data processing apparatus by using the computed available space as a factor.

5. A method as defined in claim 3, wherein the data designating a classification track among the plurality of classification tracks for which the data processing apparatus has computed that available space exists to receive all the cars of the train block.

6. A method for computing railcar switching solutions as defined in claim 1, wherein the data is a first data and the at least one car belongs to a train block, the method including receiving at an input of the data processing apparatus second data indicative of an ETA at the railway switchyard of one or more cars of the train block, the method including processing the second data with the data processing apparatus under control of the software in computing one or more of the car switching solutions for the at least one car.

7. A method as defined in claim 1, wherein the at least one car belongs to a first train block, the method including computing with the data processing apparatus a car switching solution for the at feast one car that locates the at least one car in a classification track containing cars that belong to a second train block, wherein the first train block and the second train block belong to different departure trains.

8. A method as defined in claim 3, wherein the data processing apparatus includes an input, wherein the data is a first data and wherein the train block is a first train block, the method including:

a) providing at the input second data indicative of a pull time of a second train block in a first classification track of the plurality of classification tracks;

b) processing with the data processing apparatus under control of the software the second data to determine available space in the first classification track.

9. A method as defined in claim 8, wherein the pull time is indicative of a time at which the second train block is expected to vacate the first classification track.

10. A method as defined in claim 1, wherein the data processing apparatus includes an input, wherein the data is a first data and wherein the at least one car belongs to a first train block, the method including:

a) providing at the input second data indicative of an arrival profile of a second train block;

b) processing with the data processing apparatus under control of the software the second data to compute or more of the switching solutions of the at least one car.

11. A method as defined in claim 2, including re-computing with the data processing apparatus an expected switch time for the at least one car at each computation of a switching solution for the at least one car.