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

• US 20080119973A1
• Filed: 11/17/2006
• Published: 05/22/2008
• Est. Priority Date: 12/30/2005
• Status: Active Grant

• Current Assignee: Canadian National Railway Company
• Original Assignee: Canadian National Railway Company
• Inventors: Pathak, Anshu, Barker, Matthew
• Granted Patent: US 8,055,397 B2
• 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

As embodied and broadly described herein the invention includes a system for computing a preferred sequence in which cars in a switching queue of a railway switchyard are to be sequentially switched to classification tracks. The system has a processing entity for determining within a given set of cars at least two possible sequences in which the cars in the set can be switched and applying logic rules for identifying among the sequences a preferred sequence. The system also has an output for releasing data describing the preferred sequence.

Claims

1. ) A system for computing a preferred sequence in which cars in a switching queue of a railway switchyard are to be sequentially switched to classification tracks, said system comprising;

a) a processing entity for;

i) determining within a given set of cars at least two possible sequences in which the cars in the set can be switched;

ii) applying logic rules for identifying among the sequences a preferred sequence;

b) an output for releasing data describing the preferred sequence.

2. ) A system as defined in claim 1, wherein said output includes a user interface for communicating the preferred sequence to a user.

3. ) A system as defined in claim 2, wherein said identifying includes deriving a performance status of the railway switchyard that is likely to be produced for two or more of the sequences.

4. ) A system as defined in claim 3, wherein said identifying includes comparing the performance status of the railway switchyard associated with a first sequence with the performance status of the railway switchyard associated with a second sequence.

5. ) A system as defined in claim 4, wherein said identifying includes selecting a sequence as the preferred sequence on the basis of said comparing.

6. ) A system as defined in claim 5, wherein the deriving of a performance status of the railway switchyard associated with a given sequence includes a computation of an expected switching time of one or more cars in the given sequence.

7. ) A system as defined in claim 6, wherein the deriving of a performance status of the railway switchyard associated with a given sequence includes a computation of an expected switching time of every car in the given sequence.

8. ) A system as defined in claim 6, wherein the computation of an expected switching time of a given car in the given sequence takes into account a number of cars that precede the given car in the switching queue.

9. ) A system as defined in claim 5, wherein the deriving of a performance status of the railway switchyard associated with a given sequence includes an identification of one or more possible departure trains that can carry one or more of the cars of the given sequence out of the switchyard.

10. ) A system as defined in claim 9, wherein the identification of one or more possible departure trains includes the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard, in a core block.

11. ) A system as defined in claim 9, wherein the identification of one or more possible departure trains includes the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard, in a filler block.

12. ) A system as defined in claim 9, wherein the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard includes a computation of an expected switching time of the car in the given sequence.

13. ) A system as defined in claim 12, wherein the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard includes distinguishing in a set of departure train, a departure trains that has a scheduled departure time that is after the expected switching time for the car from a departure train that has a scheduled departure time that is before the expected switching time for the car.

14. ) A system as defined in claim 12, wherein the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard includes an assessment of available space in the one or more departure trains to receive the car.

15. ) A system as defined in claim 3, wherein the deriving of a performance status for a given sequence includes an assessment for each car of the given sequence if the car can be successfully connected with an objective departure train.

16. ) A system as defined in claim 15, wherein the assessment for each car of the given sequence if the car can be successfully connected with an objective departure train includes an assessment of available space in the objective departure train to carry the car.

17. ) A system as defined in claim 1, wherein said identifying includes processing a complete enumeration of the at least two possible sequences.

18. ) A system as defined in claim 1, wherein said identifying includes processing a sub-sequence of the at least two possible sequences.

19. ) A system as defined in claim 1, wherein said identifying includes distinguishing between cars in the sequences that are loaded from cars in the sequences that are empty.

39. ) A railway switchyard comprising the system as defined in claim 1.

20. ) A method for computing a preferred sequence in which cars in a switching queue of a railway switchyard are to be sequentially switched to classification tracks, said method comprising;

i) determining within a given set of cars at least two possible sequences in which the cars in the set can be switched;

ii) using a computer for identifying among the sequences a preferred sequence, by applying logic rules;

iii) releasing data from the computer describing the preferred sequence.

21. ) A method as defined in claim 20, wherein the data is released via a user interface for communicating the preferred sequence to a user.

22. ) A method as defined in claim 20, wherein said identifying includes deriving a performance status of the railway switchyard that is likely to be produced for two or more of the sequences.

23. ) A method as defined in claim 22, wherein said identifying includes comparing the performance status of the railway switchyard associated with a first sequence with the performance status of the railway switchyard associated with a second sequence.

24. ) A method as defined in claim 23, wherein said identifying includes selecting a sequence as the preferred sequence on the basis of said comparing.

25. ) A method as defined in claim 22, wherein the deriving of a performance status of the railway switchyard associated with a given sequence includes a computation of an expected switching time of one or more cars in the given sequence.

26. ) A method as defined in claim 25, wherein the deriving of a performance status of the railway switchyard associated with a given sequence includes a computation of an expected switching time of every car in the given sequence.

27. ) A method as defined in claim 25, wherein the computation of an expected switching time of a given car in the given sequence takes into account a number of cars that precede the given car in the switching queue.

28. ) A method as defined in claim 22, wherein the deriving of a performance status of the railway switchyard associated with a given sequence includes an identification of one or more possible departure trains that can carry one or more of the cars of the given sequence out of the switchyard.

29. ) A method as defined in claim 28, wherein the identification of one or more possible departure trains includes the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard, in a core block.

30. ) A method as defined in claim 28, wherein the identification of one or more possible departure trains includes the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard, in a filler block.

31. ) A method as defined in claim 28, wherein the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard includes a computation of an expected switching time of the car in the given sequence.

32. ) A method as defined in claim 30, wherein the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard includes distinguishing in a set of departure train, departure trains that have a scheduled departure time that is after the expected switching time for the car from departure trains that have a scheduled departure time that is before the expected switching time for the car.

33. ) A method as defined in claim 28, wherein the identification of one or more possible departure trains that can carry a car of the given sequence out of the switchyard includes an assessment of available space in the departure trains to receive the car.

34. ) A method as defined in claim 22, wherein the deriving of a performance status for a given sequence includes an assessment for each car of the given sequence if the car can be successfully connected with an objective departure train.

35. ) A method as defined in claim 34, wherein the assessment for each car of the given sequence if the car can be successfully connected with an objective departure train includes an assessment of available space in the objective departure train to carry the car.

36. ) A method as defined in claim 20, wherein said identifying includes processing a complete enumeration of the at least two possible sequences.

37. ) A method as defined in claim 20, wherein said identifying includes processing a sub-sequence of the at least two possible sequences.

38. ) A method as defined in claim 20, wherein said identifying includes distinguishing between cars in the sequences that are loaded from cars in the sequences that are empty.