Method and apparatus for planning the movement of trains using dynamic analysis

Information

  • Patent Grant
  • 7734383
  • Patent Number
    7,734,383
  • Date Filed
    Tuesday, May 2, 2006
    18 years ago
  • Date Issued
    Tuesday, June 8, 2010
    14 years ago
Abstract
A method of planning the movement of plural trains through a rail network using a database of dynamic planning attributes reflecting the current conditions of the train and rail network.
Description
RELATED APPLICATIONS

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


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


Application Ser. No. 11/415,274 entitled “Method and Apparatus for Planning Linked Train Movements”; and


Application Ser. No. 11/415,272 entitled “Method of Planning the Movement of Trains Using Route Protection.”


The disclosure of each of the above referenced applications are 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 embodiment disclosed, to the scheduling of the movement of freight trains over a railroad system, and specifically to the managing the dynamic properties of the plan.


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.


Currently, a dispatcher's view of the controlled railroad territory can be considered myopic. Dispatcher's view and processes information only within their own control territories and have little or no insight into the operation of adjoining territories, or the railroad network as a whole. Current dispatch systems simply implement controls as a result of the individual dispatcher's decisions on small portions of the railroad network and the dispatchers are expected to resolve conflicts between movements of objects on the track (e.g. trains, maintenance vehicles, survey vehicles, etc.) and the available track resource limitations (e.g. limited number of tracks, tracks out of service, consideration of safety of maintenance crews near active tracks) as they occur, with little advanced insight or warning.


A train schedule is an approximate strategic forecast for a train provided by a customer for the desired movements of trains. The train schedule may be made days, weeks or months in advance. The actual train behavior is a function of many factors, such as (a) work to be performed along the route, (b) consist-based constraints (e.g., height, width, weight, speed, hazmat and routing restrictions), (c) re-crew requirements, and (d) the physics of the train and locomotive consist. These factors vary from day to day and for the same train along its route.


The movement plan for trains cannot be accurate in the absence of this information, which is available to the railroad, but is generally not available in sufficient detail for the movement planner. If the movement planner is not provided with the needed information, including dynamic variation in time and route, train movement will be planned and auto routed in a manner inconsistent with the then-current conditions. For example, if a block is placed in front of a train and the movement planner has not received this information, the movement plan may route the train to a location it cannot advance out of.


Typically, prior art movement planners calculate movement plans from static train schedules and fixed train priorities. Train characteristics are not forecast at all points along the planned route; instead the plan is typically based on default characteristics, characteristics applicable at the current location of the train, or characteristics assumed upon terminal departures. Line of the road and terminal attributes are treated as constant throughout the planning process to simply the complexity of the scheduling problem, and due to a lack of coordination in data collection from the railroad, dispatcher and filed sensors.


The present disclosure provides a database of train characteristics derived from the railroad's management information systems, field sensors and dispatch input to provide an improved movement plan that reflects the most current characteristics of the train and attributes of the line or road.


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 functional representation of an embodiment of planning the movement of trains using dynamic analysis.





DETAILED DESCRIPTION


FIG. 1 illustrates a database 100 which includes input from the railroad's management information system, field sensors, and dispatch input to provide planning attributes. The planning attributes may include train characteristics 110, line-of-road resources 120 and terminal resources 130. The database 100 may include (a) trip plan including route requirements and activities for each train, (b) locomotive consist, describing the characteristics and on train and off-train location of each current and future locomotive, (c) pick-up and set out locations, (d) consist constraints such as speed, height, width, weight, hazmat and special handling need as a function of location along planned route, (e) consist summaries along the planned route (loads, empties, tonnage and length), and (f) crew information, including on-train and off-train locations and service expiration times. The integrated database 100 automatically provides accurate information to the movement planner without additional attention from the dispatcher. The movement planner my use well known optimizing techniques including those disclosed in the referenced patents and applications. Train schedule 150 is supplied by the railroad and an optimized movement plan is generated by movement planner 140 based on the most current train characteristics, line of road resources and terminal resources from database 100.


Detailed train activity information such as activity duration, specific work locations and alternate work locations are automatically monitored from day to day, updating the activity profiles in the database. In this manner, the accuracy of the planning information is continuously improved and manual intervention which was typically required in prior art systems is eliminated. In one embodiment, the information can be based on historical performance, and appropriate averaging and weighting can be used to emphasize some measured samples based on temporal or priority constraints.


The information in the database can be forecast for each point along the route. For example, the train attributes of length, hazmat content, high/wide restrictions, horsepower, speed, stopping distance and acceleration may be dynamically altered along the route as cars and locomotives are picked up and set off. The train movement plan is based on the forecasted attributes at each point along the route. Thus changes in the train consist; specified route or track constraint anywhere along the planned route can be immediately identified and can cause the movement plan to be revised to take the most current conditions into account.


In another embodiment, the dynamic planning database can be monitored and upon the detection of a change to a planning attribute contained in the database, auto-routing of a train can be disabled until the movement planner has had time to revise the movement planner consistent with the updated planning attributes.


Thus, at each time within the planning horizon, the movement planner can apply the expected attributes of trains, line of road resources and terminal applicable at that time. If any of the data changes, the movement plan can revise the movement order based on the updated data. Train characteristics can include locomotive consist forecast, train consist forecast, crew expiration forecast, current train location upon plan calculation, expected dwell time at activity locations and train value variation along the route. The line of road resources may include reservations for maintenance of way effective and expiration time, form-based authority expiration time, bulletin item effective and expiration time and track curfew effective and expiration time. Terminal resources may include work locations, interactions with other trains, and available tracks.


In the present disclosure, movement plans are enhanced because the train characteristics and planning data are correctly accounted for as they change along the planned route. The methods of maintaining the database of dynamic planning attributes and planning the movement of trains using the current planning attributes can be implemented 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 trains over a rail network, comprising: (a) receiving a schedule for the planned movement of a train along a route;(b) monitoring and accessing a database including current train characteristics selected from the group of train length, hazmat content, high/wide restrictions, horsepower, speed, stopping distance, acceleration, and combinations thereof;(c) detecting a change to any train characteristic in the database;(d) predicting a train characteristic of the train at plural locations along the route as a function of the detection of the change; and(e) planning the movement of the train as a function of the predicted train characteristic at ones of the plural locations along the route.
  • 2. The method of claim 1 wherein the information contained in the database is derived from historical performance.
  • 3. The method of claim 1 further comprising the steps of: (f) disabling autorouting of the train as a function of the detection of a change to a planning attribute.
  • 4. The method of claim 1 further including the step of updating the database with information received from a field sensor.
  • 5. A method of planning the movement of trains over a rail network, comprising: (a) receiving a schedule for the planned movement of a train along a route;(b) maintaining a database of train characteristics;(c) planning the movement of the train as a function of the train characteristics;(d) updating the database with information received from a railroad management information system;(e) monitoring the database to detect a change to any train characteristic;(f) predicting a train characteristic of the train at plural locations along the route as a function of the detected change; and(g) planning the movement of the train as a function of the predicted train characteristic at ones of the plural locations along the route.
  • 6. The method of claim 5 wherein the train characteristics are selected from the group of train length, hazmat content, high/wide restrictions, horsepower, speed, stopping distance, acceleration, and combinations thereof.
  • 7. The method of claim 5 wherein information received from a railroad's management information system includes information received from a field sensor.
  • 8. A computer readable storage medium storing a program for controlling the movement of plural trains over a rail network, the computer program comprising: a computer usable medium having computer readable program code modules embodied in said medium for planning the movement of trains;a computer readable first program code module for receiving a schedule for the planned movement of a train along a route;a computer readable second program code module for monitoring and accessing a database including current train characteristics selected from the group of train length, hazmat content, high/wide restrictions, horsepower, speed, stopping distance, acceleration, and combinations thereof;a computer readable third program code module for detecting a change to any train characteristic in the database;a computer readable fourth program code module for predicting a train characteristic of the train at plural locations along the route as a function of the detection of the change; anda computer readable fifth program code module for planning the movement of the train as a function of the predicted train characteristic at ones of the plural locations along the route.
  • 9. The computer program of claim 8 further comprising a computer readable sixth program code module for updating the database with information received from a railroad management information system.
US Referenced Citations (77)
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
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
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
5625559 Egawa 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
5836529 Gibbs Nov 1998 A
5850617 Libby Dec 1998 A
6032905 Haynie Mar 2000 A
6115700 Ferkinhoff et al. Sep 2000 A
6125311 Lo Sep 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
6459965 Polivka et al. Oct 2002 B1
6587764 Nickles et al. Jul 2003 B2
6637703 Matheson et al. Oct 2003 B2
6654682 Kane et al. Nov 2003 B2
6766228 Chirescu Jul 2004 B2
6789005 Hawthorne Sep 2004 B2
6799097 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
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
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
Related Publications (1)
Number Date Country
20070260369 A1 Nov 2007 US