Scheduling system and method
First Claim
1. In a multiple move, 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.
0 Assignments
0 Petitions
Accused Products
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.
-
Citations
19 Claims
-
1. In a multiple move, 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. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
- 8. In a multiple move, simulated annealing method for resolving a scheduling problem associated with a plurality of orders for train resources having an initial resource exception and a cost associated therewith by evaluating the resource exception and cost associated with each move during a search phase, the step of emphasizing cost over resource exception for a predetermined initial period of the search phase.
-
13. A method for resolving a scheduling problem associated with a plurality of orders for train resources by evaluating available moves in a 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
g) accepting or rejecting the move based on the evaluation. - View Dependent Claims (14, 15, 16)
-
-
17. In a multiple move, simulated annealing method of scheduling train resources by considering the resource exception value and the cost associated with each of the moves, the improvement comprising the step of limiting the total resource exception time to approximately one percent of the total unopposed trip time.
-
18. In a multiple move, simulated annealing method of solving a problem in the scheduling of train resources, the improvement comprising the step of reducing the level of acceptance of a solution in the evaluations of the results of early moves in order to preserve options for subsequent moves.
-
19. In a multiple move, simulated annealing method for resolving a scheduling problem associated with a plurality of orders for train resources having an initial resource exception and a cost associated therewith by evaluating the resource exception and cost associated with each move during a search phase, the steps of;
-
(a) providing a target resource exception; and
(b) weighting evaluations of the effects of subsequent moves on the resource exception and cost as a function of the departure of resource exception from the target.
-
Specification