Method of planning the movement of trains using route protection

Information

  • Patent Grant
  • 8498762
  • Patent Number
    8,498,762
  • Date Filed
    Tuesday, May 2, 2006
    18 years ago
  • Date Issued
    Tuesday, July 30, 2013
    11 years ago
Abstract
A method of planning the movement of plural trains over a train network utilizing route protection for the route immediately ahead of a train to avoid undesirable changes to the planned route of the train.
Description
RELATED APPLICATIONS

The present application is being filed concurrently with the following related applications, each of which is commonly owned:


U.S. application Ser. No. 11/415,273 entitled “Method of Planning Train Movement Using a Front End Cost Function”;


U.S. application Ser. No. 11/415,274 entitled “Method and Apparatus for Planning Linked Train Movements; and


U.S. application Ser. No. 11/415,275 entitled “Method and Apparatus for Planning the Movement of Trains Using Dynamic Analysis”; and


The disclosure of each of the above referenced applications including those concurrently filed herewith is hereby incorporated herein by reference.


BACKGROUND OF THE INVENTION

The present invention relates to the scheduling of movement of plural units through a complex movement defining system, and in the embodiments disclosed, to the scheduling of the movement of freight trains over a railroad system utilizing route protection.


Systems and methods for scheduling the movement of trains over a rail network have been described in U.S. Pat. Nos. 6,154,735, 5,794,172, and 5,623,413, the disclosure of which is hereby incorporated by reference.


As disclosed in the referenced patents and applications, the complete disclosure of which is hereby incorporated herein by reference, railroads consist of three primary components (1) a rail infrastructure, including track, switches, a communications system and a control system; (2) rolling stock, including locomotives and cars; and, (3) personnel (or crew) that operate and maintain the railway. Generally, each of these components are employed by the use of a high level schedule which assigns people, locomotives, and cars to the various sections of track and allows them to move over that track in a manner that avoids collisions and permits the railway system to deliver goods to various destinations.


As disclosed in the referenced patents and applications, a precision control system includes the use of an optimizing scheduler that will schedule all aspects of the rail system, taking into account the laws of physics, the policies of the railroad, the work rules of the personnel, the actual contractual terms of the contracts to the various customers and any boundary conditions or constraints which govern the possible solution or schedule such as passenger traffic, hours of operation of some of the facilities, track maintenance, work rules, etc. The combination of boundary conditions together with a figure of merit for each activity will result in a schedule which maximizes some figure of merit such as overall system cost.


As disclosed in the referenced patents and applications, and upon determining a schedule, a movement plan may be created using the very fine grain structure necessary to actually control the movement of the train. Such fine grain structure may include assignment of personnel by name as well as the assignment of specific locomotives by number, and may include the determination of the precise time or distance over time for the movement of the trains across the rail network and all the details of train handling, power levels, curves, grades, track topography, wind and weather conditions. This movement plan may be used to guide the manual dispatching of trains and controlling of track forces, or provided to the locomotives so that it can be implemented by the engineer or automatically by switchable actuation on the locomotive.


The planning system is hierarchical in nature in which the problem is abstracted to a relatively high level for the initial optimization process, and then the resulting course solution is mapped to a less abstract lower level for further optimization. Statistical processing is used at all levels to minimize the total computational load, making the overall process computationally feasible to implement. An expert system is used as a manager over these processes, and the expert system is also the tool by which various boundary conditions and constraints for the solution set are established. The use of an expert system in this capacity permits the user to supply the rules to be placed in the solution process.


In prior art movement planners, plans are periodically generated which result in an optimized planned movement of the trains. Typically, the actual movement of the trains is monitored in some manner, and if deviations to the planned movement occur, a replanning cycle occurs to make modifications to the movement plan to account for the deviations.


One problem with the typical optimizing movement planner is that because the railroad environment is dynamic, the detailed plan for a train (e.g., it's meet and pass locations) may change each time the movement plan is calculated. While the changed route for a train may be optimal in some sense, changes to the movement plan for a train are undesirable operationally if they affect the route immediately ahead of the train. For example, the planner may have planned a specific train meet, and the dispatcher may have taken actions in reliance on the planned train meet. If the meet is changed at the last minute due to the calculation of a marginally better plan, the dispatcher may not have sufficient time to react to the new train meet and the undisclosed plans of the dispatcher may be disrupted.


This problems stems from the movement planner continually striving to produce the most optimum movement plan. However, if multiple routes are almost equally optimal, the slightest environmental change may cause the planner to shift from one route to the other route, resulting in thrashing, i.e., the repeated change back and forth between alternate routes. This is very problematic for the dispatcher who may need to take specific actions based in the route chosen.


Thus, while last minute route changes are desirable when they result in a clearly superior alternate, i.e., the previous route has become impassable due to a track block, plan changes immediately head of the train for a nominally optimal route are clearly undesirable.


The present disclosure avoids these problems found in the prior art by protecting the route immediately ahead of a train to avoid trashing that would otherwise occur.


SUMMARY OF THE INVENTION

These and many other objects and advantages of the present invention will be readily apparent to one skilled in the art to which the invention pertains from a perusal of the claims, the appended drawings, and the following detailed description of the embodiments.





BRIEF DESCRIPTION OF THE DRAWING


FIG. 1 is a simplified pictorial representation of one embodiment of a method utilizing route protection.





DETAILED DESCRIPTION

In the present disclosure, a method of determine whether to protect a route, and the extent of the route protection is utilized to prevent an optimizing movement planner from thrashing while searching for the most optimal solution. FIG. 1 represents the inputs used to determine whether and to what extent route protection is need. Train states 100 provides the current state of the train and provides the starting point for determining the extent of route protection. Train authorities 110 includes identification of whether a train is under CTC or form based control which affects the extent of route protection. Track restrictions 120 assist n the extent of route protection as restrictions affect the available routes and solutions. The latest plan 130 together with the train state provides feedback as to actual operation against the planned movement of the train. Topology 140 provides input which directly impact train handling characteristics. Freeze interval 150 and the current time defines how long the route protection should be in place. The protected plan 170 is provided which places a temporal or geographical restriction on changes to the trains planned route.


The inputs are evaluated to determine whether and to what extent a train's plan should be protected. Protecting too much limits the ability to repair or reschedule the movement of the train. Protecting too little causes plan instability and may cause the auto-router to clear signals unnecessarily. In congested areas, protecting too much can reduce the number of alternatives or may cause deadlocks. In form based authority areas or CTC areas, the route protection can be geographic in scope. In other areas, the route protection may be implemented as a function of time.


If the inputs are evaluated to provide that a clearly more optimal alternate plan is available, no route protection may be implemented at all. For example, in cases where a planned route becomes unavailable alternate route immediately ahead of the train may be more desirable. Where the inputs result in an alternate plan that does not exceed a predetermined threshold, the inputs are used to determine the extent of route protection that should be accorded the train.


In operation, the route protection can be provided when a train deviates from its planned route and a new movement plan is generated which is not sufficiently better to warrant switching to the new movement plan. In this case, a portion of the original movement plan immediately ahead of the train may be protected and the remainder of the plan may be modified to account for deviations. In one aspect the method could include providing a first movement plan for a train, monitoring the actual movement of the train, evaluating the actual movement of the train against the planned movement, providing a second movement plan for train to account for deviations of the actual train movement from the first movement plan, evaluating the first movement plan against the second movement plan, preventing modification to a first portion of the first movement plan if the difference between the first and second movement plan is less than a predetermined threshold, and modifying a second portion of the first movement plan to account for the deviations. In the case of form based movement authority control or in areas of CTC, the first portion of the first movement plan may represent a geographical area immediately ahead of the train. In other areas, the first portion of the movement plan is a period of time.


In another aspect, when modifications to the movement plan are needed, the area in front of the train is protected from any modification. For example, the aspect could be implemented by providing a first movement plan for a train, monitoring the actual movement of the train, evaluating the actual movement of the train against the planned movement including the current location of the train at the current time, modifying the first movement plan to account for deviations of the actual train movement from the first movement plan, and preventing modification of the first movement plan for a predetermined distance from the location of the train. The predetermined distance may a function of a block control of the train or of a movement authority issued for the train.


In another embodiment, prior to implementing route protection, an analysis of the planned route to be protected is performed and adjustments to the plan may be made taking into account the current status of the train and the planned route. Once the route protection is in place, no further modifications to the plan for the protected portion may be made, and thus minor adjustments just prior to route protection are sometimes desirable. For example, if a train is currently behind its planned movement, an increase in planned velocity may be desirable before implementing route protection. Additionally it may be useful to search for new track restriction or track blocks in the area to be protected prior to implementation of route protection in order to take these restrictions and blocks into account.


The method of protecting the route immediately ahead of a train may be implemented as described herein using computer usable medium having a computer readable code executed by special purpose or general purpose computers.


While embodiments of the present invention have been described, it is understood that the embodiments described are illustrative only and the scope of the invention is to be defined solely by the appended claims when accorded a full range of equivalence, many variations and modifications naturally occurring to those of skill in the art from a perusal hereof.

Claims
  • 1. A method of planning the movement of plural trains over a rail network comprising: (a) providing a first movement plan for a train, said first movement plan including a plurality of portions;(b) monitoring the actual movement of the train;(c) evaluating the actual movement of the train in a computer system against the planned movement;(d) providing a second movement plan for the train to account for deviations of the actual train movement from the first movement plan;(e) evaluating the first movement plan against the second movement plan;(f) preventing modification to a first portion of the first movement plan if the difference between the first and second movement plan is less than a predetermined threshold; and(g) modifying a second portion of the first movement plan to account for the deviations.
  • 2. The method of claim 1 wherein the first portion of the first movement plan represents a geographical area.
  • 3. The method of claim 1 wherein the first portion of the first movement plan is a period of time.
  • 4. The method of claim 2 wherein the geographical area is chosen as a function of the track authorities issued for the train.
  • 5. The method of claim 2 wherein the second portion of the first movement plan represents a geographical area.
  • 6. The method of claim 3 wherein the second portion of the first movement plan is a period of time.
  • 7. A method of planning the movement of plural trains over a rail network comprising: (a) providing a first movement plan for a train;(b) monitoring the actual movement of the train;(c) evaluating the actual movement of the train in a computer system against the planned movement including the current location of the train at the current time;(d) modifying the first movement plan to account for deviations of the actual train movement from the first movement plan; and(e) preventing modification of the first movement plan for a predetermined distance from the location of the train.
  • 8. The method of claim 7 wherein the predetermined distance is a function of a block control of the train.
  • 9. The method of claim 7 wherein the predetermined distance is a function of a movement authority issued for the train.
  • 10. A method of planning the movement of plural trains over a rail network comprising: (a) providing a first movement plan for a train, said first movement plan including a plurality of portions;(b) monitoring the actual movement of the train;(c) evaluating the actual movement of the train in a computer system against the first movement plan;(d) calculating deviations representing differences between the actual movement and the first movement plan;(e) preventing modification to a first portion of the first movement plan immediately ahead of the train as function of the deviations; and(f) modifying a second portion of the first movement plan to account for the deviations.
  • 11. The method of claim 10 wherein said first portion of the first movement plan represents a geographical area.
  • 12. The method of claim 10 wherein said first portion of the first movement plan is a period of time.
  • 13. The method of claim 11 wherein the geographical area is chosen as a function of the track authorities issued for the train.
US Referenced Citations (85)
Number Name Date Kind
3575594 Elcan Apr 1971 A
3734433 Metzner May 1973 A
3794834 Auer, Jr. et al. Feb 1974 A
3839964 Gayot Oct 1974 A
3895584 Paddison Jul 1975 A
3915580 Kaufman Oct 1975 A
3944986 Staples Mar 1976 A
4099707 Anderson Jul 1978 A
4122523 Morse et al. Oct 1978 A
4361300 Rush Nov 1982 A
4361301 Rush Nov 1982 A
4610206 Kubala et al. Sep 1986 A
4669047 Chucta May 1987 A
4750129 Hengstmengel et al. Jun 1988 A
4791871 Mowll Dec 1988 A
4843575 Crane Jun 1989 A
4883245 Erickson, Jr. Nov 1989 A
4926343 Tsuruta et al. May 1990 A
4937743 Rassman et al. Jun 1990 A
5038290 Minami Aug 1991 A
5063506 Brockwell et al. Nov 1991 A
5177684 Harker et al. Jan 1993 A
5222192 Shafer Jun 1993 A
5229948 Wei et al. Jul 1993 A
5237497 Sitarski Aug 1993 A
5265006 Asthana et al. Nov 1993 A
5289563 Nomoto et al. Feb 1994 A
5311438 Sellers et al. May 1994 A
5331545 Yajima et al. Jul 1994 A
5332180 Peterson et al. Jul 1994 A
5335180 Takahashi et al. Aug 1994 A
5365516 Jandrell Nov 1994 A
5390880 Fukawa et al. Feb 1995 A
5420883 Swensen et al. May 1995 A
5437422 Newman Aug 1995 A
5463552 Wilson et al. Oct 1995 A
5467268 Sisley et al. Nov 1995 A
5487516 Murata et al. Jan 1996 A
5541848 McCormack et al. Jul 1996 A
5623413 Matheson et al. Apr 1997 A
5745735 Cohn et al. Apr 1998 A
5794172 Matheson et al. Aug 1998 A
5823481 Gottschlich Oct 1998 A
5825660 Cagan et al. Oct 1998 A
5828979 Polivka et al. Oct 1998 A
5850617 Libby Dec 1998 A
6032905 Haynie Mar 2000 A
6115700 Ferkinhoff et al. Sep 2000 A
6125311 Lo Sep 2000 A
6135396 Whitfield et al. Oct 2000 A
6144901 Nickles et al. Nov 2000 A
6154735 Crone Nov 2000 A
6250590 Hofestadt et al. Jun 2001 B1
6351697 Baker Feb 2002 B1
6377877 Doner Apr 2002 B1
6393362 Burns May 2002 B1
6405186 Fabre et al. Jun 2002 B1
6459964 Vu et al. Oct 2002 B1
6459965 Polivka et al. Oct 2002 B1
6546371 Doner Apr 2003 B1
6587738 Belcea Jul 2003 B1
6587764 Nickles et al. Jul 2003 B2
6637703 Matheson et al. Oct 2003 B2
6641090 Meyer Nov 2003 B2
6654682 Kane et al. Nov 2003 B2
6766228 Chirescu Jul 2004 B2
6789005 Hawthorne Sep 2004 B2
6799097 Villarreal Antelo Sep 2004 B2
6799100 Burns Sep 2004 B2
6853889 Cole Feb 2005 B2
6856865 Hawthorne Feb 2005 B2
7006796 Hofmann et al. Feb 2006 B1
7212134 Taylor May 2007 B2
7425903 Boss et al. Sep 2008 B2
20030105561 Nickles et al. Jun 2003 A1
20030183729 Root et al. Oct 2003 A1
20040010432 Matheson et al. Jan 2004 A1
20040034556 Matheson et al. Feb 2004 A1
20040093196 Hawthorne May 2004 A1
20040093245 Matheson et al. May 2004 A1
20040267415 Lacote et al. Dec 2004 A1
20050107890 Minkowitz et al. May 2005 A1
20050192720 Christie et al. Sep 2005 A1
20060074544 Morariu et al. Apr 2006 A1
20080004794 Horvitz Jan 2008 A1
Foreign Referenced Citations (15)
Number Date Country
2057039 Dec 1990 CA
2066739 Feb 1992 CA
2046984 Jun 1992 CA
2112302 Jun 1994 CA
2158355 Oct 1994 CA
0108363 May 1984 EP
0193207 Sep 1986 EP
0341826 Nov 1989 EP
0554983 Aug 1993 EP
2692542 Dec 1993 FR
1321053 Jun 1973 GB
1321054 Jun 1973 GB
3213459 Sep 1991 JP
WO 9003622 Apr 1990 WO
WO 9315946 Aug 1993 WO
Non-Patent Literature Citations (10)
Entry
Crone, et al., “Distributed Intelligent Network Management for the SDI Network,” IEEE, 1991, pp. 722-726, MILCOM '91.
Ghedira, “Distributed Simulated Re-Annealing for Dynamic Constraint Satisfaction Problems,” IEEE 1994, pp. 601-607.
Hasselfield, et al., “An Automated Method for Least Cost Distribution Planning,” IEEE Transactions on Power Delivery, vol. 5, No. 2, Apr. 1990, 1188-1194.
Herault, et al., “Figure-Ground Discrimination: A Combinatorial Optimization Approach,” IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 15, No. 9, Sep. 1993, 899-914.
Igarashi, “An Estimation of Parameters in an Energy Fen Used in a Simulated Annealing Method,” IEEE, 1992, pp. IV-180-IV-485.
Komaya, “A New Simulation Method and its Application to Knowledge-based Systems for Railway Scheduling,” May 1991, pp. 59-66.
Puget, “Object Oriented Constraint Programming for Transportation Problems,” IEEE 1993, pp. 1-13.
Sasaki, et al., “Development for a New Electronic Blocking System,” QR of RTRI, vol. 30, No. 4, Nov. 1989, pp. 198-201.
Scherer, et al., “Combinatorial Optimization for Spacecraft Scheduling,” 1992 IEEE International Conference on Tolls with AI, Nov. 1992, pp. 120-126.
Watanabe, et al., “Moving Block System with Continuous Train Detection Utilizing Train Shunting Impedance of Track Circuit,” QR of RTRI, vol. 30, No. 4, Nov. 1989, pp. 190-197.
Related Publications (1)
Number Date Country
20070260367 A1 Nov 2007 US