Abstract: A method of optimizing the movement of plural trains using a front end cost function that evaluates the costs of each railcar in the consist of a train.

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.

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.

Abstract: A scheduling system and method for identifying and planning for the linked movement of two or more trains.

Abstract: A system and method for generating a computer-aided rail yard plan for the movement of plural railcars through a rail yard, the rail yard having tracks that are used as receiving tracks, classification tracks and departure tracks and the plural railcars arriving on inbound trains and departing on outbound trains, the plural railcars required to undergo a sequence of tasks to move through the rail yard, the yard plan providing (a) a schedule for receiving trains, (b) a schedule for inspecting cars on receiving tracks, (c) a schedule for humping cars from receiving tracks into classification tracks, (d) a schedule for pulling trains onto departure tracks, (e) a schedule for testing trains, and (f) a schedule for departing trains.

Abstract: A scheduling system and method for moving plural objects through a system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system. Train location reports used in the automatic updating of the movement plans are selectively disabled for individual trains as a function of the activity scheduled for that train.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system. Alternative routes through congested areas are automatically selected using congestion prediction metrics.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system, and is particularly useful in optimizing the value of trains moved against the penalty for postponement of maintenance of the right of way.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system, and is particularly useful in managing the unpredictable movement of local industry trains.

Abstract: A scheduling system and method for moving plural objects through a system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system. The actual location where an activity is to be performed is automatically selected as a function of one or more specified criteria.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system. Similar movement planners exist for moving trains in yards or terminals. Coordination is achieved and system efficiency improved by interfacing the line of road and yard planners.

Abstract: A scheduling system and method for moving plural objects through a system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system. The estimation of the location of trains in track warranty locations where track sensor and GPS indications are not available is made based on the movement planners and the form-based movement authorities issued to each trains. Certain user interactions are interpreted as a specific train location.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system. Deadlock is avoided by controlling the entry of trains into congested areas, and may be automatically implemented by the use of traffic flow analysis algorithms.