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

• US 20070179688A1
• Filed: 03/23/2006
• Published: 08/02/2007
• Est. Priority Date: 12/30/2005
• Status: Abandoned Application

• Current Assignee: Canadian National Railway Company
• Original Assignee: Canadian National Railway Company
• Inventors: Morency, Vincent, Pathak, Anshu, Doyle, Gordon, Muinonen, Kari, Barker, Matthew
• Application Number:
  US11/387,347
• Publication Number:
  US 20070179688A1
• Time in Patent Office: Days
• US Class Current: 701/19
• CPC Class Codes: B61L 17/00 Switching systems for classification yards
• CPC Class Codes: B61L 17/02 Details, e.g. indicating degree of track filling

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 system for computing car switching solutions in a railway switch yard, said system comprising:

a) an input for receiving;

i) first data conveying information about one or more arrival trains arriving at the switch yard, an arrival train including a plurality of cars;

ii) second data conveying information about departure trains to depart the switch yard;

b) a processing entity for processing the first and second data and compute car switching solutions for the cars;

c) an output for releasing third data conveying the car switching solutions.

2. ) A system as defined in claim 1, wherein said output includes a user interface allowing communicating to a user the car switching solutions.

3. ) A system as defined in claim 1, wherein said output is intended for connection to a car switch control system that derives car switching commands from the third data.

4. ) A system as defined in claim 1, wherein said processing entity computes an expected switch time for one or more cars and uses the computed expected switch time to compute car switching solutions for the one or more cars.

5. ) A system as defined in claim 1, wherein the railway switch yard has a switching queue containing a plurality of cars to be sequentially switched to classification tracks, said processing unit computing multiple switching solutions for one or more cars as the one or more cars progress through the switching queue.

6. ) A system as defined in claim 1, wherein said input receives data indicative of an ETA of a car at the switch yard, said processing unit computing one or more car switching solutions by using the data indicative of an ETA as a factor.

7. ) A system as defined in claim 1, wherein said processing entity computes car switching solutions concurrently locating a first set of cars and a second set of cars in a common classification track, wherein the first and second sets of cars belong to train blocks of different departure trains.

8. ) A system as defined in claim 1, wherein the classification yard has a plurality of classification tracks, wherein a first classification track holds a first train block, wherein said input receives data conveying information related to a pull time of the first train block and wherein said processing entity determines if space exists in the first classification track to receive cars that belong to a second train block, by using as a factor the information related to the pull time of the first train block.

9. ) A system as defined in claim 1, wherein the switch yard has a plurality of classification tracks and wherein a first classification track holds a first train block, wherein said input receives data conveying information related to an arrival profile of a second train block and wherein said processing entity determines if space exists in the first classification track to receive cars that belong to the second train block, by using as a factor the information related to the arrival profile of the second train block.

10. ) A system as defined in claim 1, wherein the switch yard is a hump switch yard.

11. ) A system as defined in claim 1, wherein the switch yard is a flat switch yard.

12. ) A method for computing car switching solutions in a railway switch yard, said method comprising:

a) receiving at an input of a computing apparatus;

i) first data conveying information about one or more arrival trains arriving at the switch yard, an arrival train including a plurality of cars;

ii) second data conveying information about departure trains to depart the switch yard;

b) processing with the computing apparatus the first and second data and computing car switching solutions for the cars;

c) releasing third data conveying the car switching solutions.

13. ) A method as defined in claim 12, including communicating to a user the car switching solutions.

14. ) A method as defined in claim 12, including communicating the third data to a car switch control system that derives car switching commands from the third data.

15. ) A method as defined in claim 12, including computing an expected switch time for one or more cars and using the computed expected switch time to compute car switching solutions for the one or more cars.

16. ) A method as defined in claim 12, wherein the railway switch yard has a switching queue containing a plurality of cars to be sequentially switched to classification tracks, said method including computing multiple switching solutions for one or more cars as the one ore more cars progress through the switching queue.

17. ) A method as defined in claim 12, including receiving at said input data indicative of an ETA of a car at the switch yard, said method further including computing one or more car switching solutions by using the data indicative of an ETA as a factor.

18. ) A method as defined in claim 12, including computing car switching solutions that concurrently locate a first set of cars and a second set of cars in a common classification track of the switch yard, wherein the first and second sets of cars belong to train blocks of different departure trains.

19. ) A method as defined in claim 12, wherein the classification yard has a plurality of classification tracks, wherein a first classification track holds a first train block, wherein said method includes receiving at said input data conveying information related to a pull time of the first train block;

said method further including determining if space exists in the first classification track to receive cars that belong to a second train block, by using as a factor the information related to the pull time of the first train block.

20. ) A method as defined in claim 12, wherein the switch yard has a plurality of classification tracks and wherein a first classification track holds a first train block, wherein said method includes receiving at said input data conveying information related to an arrival profile of a second train block and wherein said method also includes determining if space exists in the first classification track to receive cars that belong to the second train block, by using as a factor the information related to the arrival profile of the second train block.

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

22. ) A method as defined in claim 12, wherein the switch yard is a flat switch yard.