Patent ID: 7092894

Claim:
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.