Cost reactive scheduler and method
AssigneeHarris Corporation
InventorMichael S. Crone
Life of this patent
Estimating the term…
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.
Claims6
In a multiple move, processor based simulated annealing method for resolving a scheduling problem associated with a plurality of orders for train resources, each order having a cost function and a scheduling window associated therewith, the improvement comprising the steps of:
- (a) establishing plural criteria for acceptance of a solution;
- (b) classifying the scheduling problem;
- and
- (c) selecting the criteria for acceptance of a solution as a function of the classification of the scheduling problem
- wherein the step of classifying includes the steps of:
- (i) determining the total trip time associated with the plurality of orders;
- (ii) determining the total slack time associated with the plurality of orders;
- (iii) determining the classification of the problem as a function of the total trip time and the slack time
- wherein the step of determining the classification is determined by the steps of:
- (a) selecting a predetermined percentage of total trip time to provide a threshold value;
- and
- (b) comparing slack time with the threshold value.
In a multiple move, processor based simulated annealing method for resolving a scheduling problem associated with a plurality of orders for train resources, each order having a cost function and a scheduling window associated therewith, the improvement comprising the steps of:
- (a) establishing plural criteria for acceptance of a solution;
- (b) classifying the scheduling problem;
- and
- (c) selecting the criteria for acceptance of a solution as a function of the classification of the scheduling problem
- wherein the step of classifying includes the steps of:
- (i) determining the total trip time associated with the plurality of orders;
- (ii) determining the resource exception associated with the plurality of orders;
- (iii) determining the classification of the problem as a function of the total trip time and the resource exception
- wherein the step of determining the classification is determined by the steps of:
- (a) selecting a predetermined percentage of total trip time to provide a threshold value;
- and
- (b) comparing resource exception with the threshold value.
A method for resolving a scheduling problem associated with a plurality of orders for train resources by evaluating available moves in a computer based simulated annealing process, each move resulting in a change in the resource exception associated with the problem and a change in cost associated with the move, comprising the steps of:
- (a) classifying the scheduling problem;
- (b) making a random move;
- (c) weighting the resource exception and cost factors associated with the random move with a scaling parameter related to the classification of the problem;
- (d) evaluating the resource exception and the cost of the solution against a predetermined criteria;
- and
- (e) accepting or rejecting the move based on the evaluation
- wherein the predetermined criteria is the classification of the problem.
Dependencies are inferred from the claim text.