System and method for computing rail car switching sequence in a switchyard
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.
1. A method for determining an order in which railcars are to be switched in a railway switchyard that has a switch, the method comprising :
a. providing a data processing apparatus including a CPU and a machine readable storage which is encoded with software for execution by the CPU;
b. processing with the software data describing a group of railcars for determining an order in which railcars from the group of railcars are to be switched by the switch, the determining including:
i. identifying among the group of railcars at least two railcar switching sequences;
ii. comparing the least two railcar switching sequences according to a metric;
iii. selecting a switching sequence on the basis of the comparing;
c. outputting output data from an output of the data processing apparatus describing the switching sequence determined on the basis of the selecting.
2. A method as defined in claim 1 , wherein the determining includes computing with the software an expected switch time for one or more railcars in a given switching sequence.
3. A method as defined in claim 1 , wherein the metric is railcar dwell time in the railway switchyard.
4. A method as defined in claim 1 , wherein the metric is a number of realized connections.
5. A method as defined in claim 1 , wherein the metric is a number of missed connections.
6. A method as defined in claim 1 , wherein the determining includes forecasting a state of the railway switchyard that is to be produced by at least one of the switching sequences.
7. A method as defined in claim 6 , wherein the determining includes forecasting a state of the railway switchyard that is to be produced by each one of the switching sequences.
8. A method as defined in claim 6 , wherein the forecasting of the state of the railway switchyard includes assigning at least one railcar of a given switching sequence to a departure train.
9. A method as defined in claim 6 , wherein the forecasting of the state of the railway switchyard includes assigning at least one railcar of a given switching sequence to a departure train, in a core block.
10. A method as defined in claim 6 , wherein the forecasting of the state of the railway switchyard includes assigning at least one railcar of a given switching sequence to a departure train, in a filler block.
11. A method as defined in claim 8 , wherein the assigning of at least one railcar of a given switching sequence to a departure train includes determining if the departure train has enough capacity to carry the railcar.
12. A method as defined in claim 1 , including transmitting the output data to a user interface for communicating the switching sequence determined on the basis of the selecting to a user.
13. A method for switching railcars in a railway switchyard that has a switch, the method comprising:
a. providing a data processing apparatus including a CPU and a machine readable storage which is encoded with software for execution by the CPU;
b. processing with the software data describing a group of railcars for determining an order in which railcars from the group of railcars are to be switched by the switch, the determining including:
i. identifying among the group of railcars a plurality of railcar switching sequences;
ii. comparing the railcar switching sequences according to a metric;
iii. selecting a switching sequence on the basis of the comparing;
a. switching railcars from the group of railcars by the switch according on the basis of the selecting.
14. A method as defined in claim 13 , wherein the determining includes computing with the software an expected switch time for one or more railcars in a given switching sequence.
15. A method as defined in claim 13 , wherein the metric is railcar dwell time in the railway switchyard.
16. A method as defined in claim 13 , wherein the metric is a number of realized connections.
17. A method as defined in claim 13 , wherein the metric is a number of missed connections.
18. A method as defined in claim 13 , wherein the determining includes forecasting a state of the railway switchyard that is to be produced by at least one of the switching sequences.
19. A method as defined in claim 13 , wherein the determining includes forecasting a state of the railway switchyard that is to be produced by each one of the switching sequences.
20. A method as defined in claim 18 , wherein the forecasting of the state of the railway switchyard includes assigning at least one railcar of a given switching sequence to a departure train.
21. A method as defined in claim 18 , wherein the forecasting of the state of the railway switchyard includes assigning at least one railcar of a given switching sequence to a departure train, in a core block.
22. A method as defined in claim 18 , wherein the forecasting of the state of the railway switchyard includes assigning at least one railcar of a given switching sequence to a departure train, in a filler block.
23. A method as defined in claim 20 , wherein the assigning of at least one railcar of a given switching sequence to a departure train includes determining if the departure train has enough capacity to carry the railcar.