System and method for computing railcar switching solutions in a switchyard using empty car substitution logic

• US 7,565,228 B2
• Filed: 03/23/2006
• Issued: 07/21/2009
• 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, Muinonen, Kari, Barker, Matthew
• Primary Examiner(s): Zanelli; Michael J.
• Application Number:
  US11/388,129
• Publication Number:
  US 20070156309A1
• Time in Patent Office: 1,216 Days
• Field of Search: None
• 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 system for computing car switching solutions in a railway switch yard that has a switching queue, a switch and a plurality of classification tracks, said switching queue holding a plurality of empty cars, 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, one of the departure trains including a particular empty car;

b) a processing entity for computing car switching solutions to assemble the departure trains, the car switching solutions being such as to substitute an empty car from the plurality of empty cars to the particular empty car;

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

2. A system for computing car switching solutions as defined in claim 1, wherein said output releases substitution data conveying information about the substitution of the empty car from the plurality of empty cars to the particular empty car.

3. A system for computing car switching solutions as defined in claim 1, wherein the processing entity generates the substitution data intended for reception by a railway traffic management system to notify the railway traffic management system that the particular empty car has been replaced by another empty car.

4. A system for computing car switching solutions as defined in claim 1, wherein said processing entity computes a switching solution to substitute an empty car from the plurality of empty cars to the particular empty car, when the particular empty car is not be available in due time to be made part of the one of the departure trains.

5. A system as defined in claim 1, wherein said input receives data indicative of an ETA at the switch yard of the particular empty car, said processing entity using the data indicative of the ETA to determine if the particular empty car can be switched in time to be made part of the one of the departure trains.

6. A system as defined in claim 1, wherein said system includes a computer readable storage medium maintaining a list of the plurality of empty cars.

7. A system as defined in claim 6, wherein said processing entity adding empty cars to the list as arrival trains deliver empty cars to the switch yard.

8. A system as defined in claim 6, wherein said processing entity removes empty cars from the list as empty cars from the plurality of empty cars are switched to classification tracks.

9. A system as defined in claim 6, wherein the empty cars in the list are distinguished from one another on a basis of respective identifiers.

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

11. 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 data conveying the car switching solutions.

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

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

14. A method for computing car switching solutions in a railway switch yard that has a switching queue, a switch and a plurality of classification tracks, the switching queue holding a plurality of empty cars, said method comprising:

a) receiving at an input;

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, one of the departure trains including a particular empty car;

b. computing car switching solutions to assemble the departure trains, the car switching solutions being such as to substitute an empty car from the plurality of empty cars to the particular empty car;

c. releasing at an output data conveying the car switching solutions.

15. A method for computing car switching solutions as defined in claim 14, wherein said output releases substitution data conveying information about the substitution of the empty car from the plurality of empty cars to the particular empty car.

16. A method for computing car switching solutions as defined in claim 14, including notifying a railway traffic management system that the particular empty car has been replaced by another empty car.

17. A method for computing car switching solutions as defined in claim 14, including generating a switching solution to substitute an empty car from the plurality of empty cars to the particular empty car, when the particular empty car is not be available in due time to be made part of the one of the departure trains.

18. A method as defined in claim 14, including receiving data indicative of an ETA at the switch yard of the particular empty car, said method also including using the data indicative of the ETA to determine if the particular empty car can be switched in time to be made part of the one of the departure trains.

19. A method as defined in claim 14, including maintaining a list of the plurality of empty cars in a computer readable storage medium.

20. A method as defined in claim 19, including adding empty cars to the list as arrival trains deliver empty cars to the switch yard.

21. A method as defined in claim 19, including removing empty cars from the list as empty cars from the plurality of empty cars are switched to classification tracks.

22. A method as defined in claim 19, wherein the empty cars in the list are distinguished from one another on a basis of respective identifiers.

23. A method as defined in claim 14, including communicating to a user the car switching solutions.

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

25. A method as defined in claim 14, wherein the switch yard is a hump switch yard.

26. A method as defined in claim 14, wherein the switch yard is a flat switch yard.