Scheduling system and method

Claim 1

A method of planning over a predetermined period of time the use of resources in a freight railway system to reduce the costs of the plan, comprising the steps of: (a) developing strategic schedule constraints on train movement in a rule based inference engine based on user-defined freight railway operating rules and an optimization of proposed schedules under relaxed constraint conditions; and (b) developing a detailed movement plan in a constraint based inference engine based upon an optimization within a predetermined tolerance of the costs of the movement plan wherein the strategic schedule constraints developed by the rule based inference engine are provided as sequencing constraints to the constraint based inference engine for development of the movement plan.

Claim 2

A method of planning over a predetermined period of time the use of resources in a freight railway system to reduce the costs of the plan, comprising the steps of: (a) developing strategic schedule constraints on train movement in a rule based inference engine based on user-defined freight railway operating rules and an optimization of proposed schedules under relaxed constraint conditions; and (b) developing a detailed movement plan in a constraint based inference engine based upon an optimization within a predetermined tolerance of the costs of the movement plan wherein the strategic schedule constraints developed by the rule based inference engine are provided as sequencing constraints to the constraint based inference engine for development of the movement plan.

Claim 15

The method of scheduling plural trips comprising the steps of: (a) identifying the activities required for each desired trip and the constraints thereof; (b) identifying available resources; (c) assigning the identified resources to each of the activities; (d) converting each of the activities into a time interval; (e) grouping time intervals into the desired trips; (f) seeking the scheduling of entire trips within the constraints; (g) dividing the trips into smaller segments and seeking the scheduling of the segments within the constraints if unable to schedule entire trips; (h) if successful in scheduling the segments, reporting the schedule; and (i) if unsuccessful in scheduling the segments, reporting the schedule with the conflicts identified.

Claim 16

The method of scheduling plural trips comprising the steps of: (a) identifying the activities required for each desired trip and the constraints thereof; (b) identifying available resources; (c) assigning the identified resources to each of the activities; (d) converting each of the activities into a time interval; (e) grouping time intervals into the desired trips; (f) seeking the scheduling of entire trips within the constraints; (g) dividing the trips into smaller segments and seeking the scheduling of the segments within the constraints if unable to schedule entire trips; (h) if successful in scheduling the segments, reporting the schedule; and (i) if unsuccessful in scheduling the segments, reporting the schedule with the conflicts identified.

Claim 22

A system for planning over a predetermined period of time the use of resources in a freight railway system to reduce the costs of the plan, comprising: (a) a rule based inference engine for developing strategic schedule constraints on train movement based on user-defined freight railway operating rules and an optimization of proposed schedules under relaxed constraint conditions; and (b) a constraint based inference engine for developing a detailed movement plan based upon an optimization within a predetermined tolerance of the costs of the movement plan wherein the strategic schedule constraints developed by said rule based inference engine are provided as sequencing constraints to said constraint based inference engine for development of the movement plan.

Claim 23

A system for planning over a predetermined period of time the use of resources in a freight railway system to reduce the costs of the plan, comprising: (a) a rule based inference engine for developing strategic schedule constraints on train movement based on user-defined freight railway operating rules and an optimization of proposed schedules under relaxed constraint conditions; and (b) a constraint based inference engine for developing a detailed movement plan based upon an optimization within a predetermined tolerance of the costs of the movement plan wherein the strategic schedule constraints developed by said rule based inference engine are provided as sequencing constraints to said constraint based inference engine for development of the movement plan.

Claim 25

A system for scheduling plural trips comprising: (a) means for identifying the activities required for each desired trip and the constraints thereof; (b) means for identifying available resources; (c) means for assigning resources to each activity; (d) means for converting each of the activities into a time interval; (e) means for grouping time intervals into the desired trips; (f) means for seeking the scheduling of entire trips within the constraints; (g) means for dividing the trips into smaller segments if unable to schedule entire trips; (h) means for seeking the scheduling of the segments within the constraints (i) means for reporting the schedule if successful in scheduling the segments; and (j) means for reporting the schedule with the conflicts identified if unsuccessful in scheduling the segments.

Claim 26

A system for scheduling plural trips comprising: (a) means for identifying the activities required for each desired trip and the constraints thereof; (b) means for identifying available resources; (c) means for assigning resources to each activity; (d) means for converting each of the activities into a time interval; (e) means for grouping time intervals into the desired trips; (f) means for seeking the scheduling of entire trips within the constraints; (g) means for dividing the trips into smaller segments if unable to schedule entire trips; (h) means for seeking the scheduling of the segments within the constraints (i) means for reporting the schedule if successful in scheduling the segments; and (j) means for reporting the schedule with the conflicts identified if unsuccessful in scheduling the segments.

Claim 28

A method of planning the implementation of an order schedule over a system comprising the steps of: (a) providing the order schedule to be implemented; (b) identifying the resources and location of resources necessary to implement each of the orders; (c) providing a detailed model of the system over which the schedule is to be implemented; (d) simulating the schedule on the model to identify and resolve conflicts; (e) displaying a planned implementation of the schedule (f) communicating to a train the train's portion of the planned implementation; and (g) determining in a processor on the train throttle and brake settings for implementing the plan.

Claim 29

A method of planning the implementation of an order schedule over a system comprising the steps of: (a) providing the order schedule to be implemented; (b) identifying the resources and location of resources necessary to implement each of the orders; (c) providing a detailed model of the system over which the schedule is to be implemented; (d) simulating the schedule on the model to identify and resolve conflicts; (e) displaying a planned implementation of the schedule (f) communicating to a train the train's portion of the planned implementation; and (g) determining in a processor on the train throttle and brake settings for implementing the plan.

Claim 34

A method of planning the movement of plural trains through a multipath railway system comprising the steps of: (a) developing a schedule for train movement using the combination of a rule based inference engine and a constraint based inference engine, wherein constraints generated by the rule based inference engine are provided as sequencing constraints to the constraint based inference engine; (b) providing the schedule and cost data relating to the trains to a procedure based inference engine for optimizing the schedule into a movement plan; and (c) displaying the modified movement plan.

Claim 35

A method of planning the movement of plural trains through a multipath railway system comprising the steps of: (a) developing a schedule for train movement using the combination of a rule based inference engine and a constraint based inference engine, wherein constraints generated by the rule based inference engine are provided as sequencing constraints to the constraint based inference engine; (b) providing the schedule and cost data relating to the trains to a procedure based inference engine for optimizing the schedule into a movement plan; and (c) displaying the modified movement plan.

Claim 42

A method of scheduling the orders relating to the use of plural resources over time in a single system comprising the steps of: (a) providing data relating to: (i) the activities required to accomplish each of the orders, (ii) delivery cost associated with each of the desired orders, (iii) selected constraints, and (iv) the availability of resources; and (b) determining the possible assignment of available resources to each of the identified activities as a function of resource capability; (c) converting the assigned activities to time intervals; (d) grouping the time intervals into complete orders; (e) seeking the scheduling of entire orders with satisfaction of all of the constraints; (f) if able to schedule entire orders, adjusting the orders within the constraints as a function of delivery cost, and reporting the schedule; (g) if unsuccessful in scheduling entire orders, dividing at least one of the complete orders into smaller groups of time intervals; (h) seeking the scheduling of the divided orders with satisfaction of all of the constraints; (i) if successful in scheduling the divided orders, adjusting the groups of time intervals within the constraints as a function of delivery cost and reporting the schedule; and (j) if unsuccessful in scheduling the divided orders, reporting the schedule with the conflicts identified.

Claim 43

A method of scheduling the orders relating to the use of plural resources over time in a single system comprising the steps of: (a) providing data relating to: (i) the activities required to accomplish each of the orders, (ii) delivery cost associated with each of the desired orders, (iii) selected constraints, and (iv) the availability of resources; and (b) determining the possible assignment of available resources to each of the identified activities as a function of resource capability; (c) converting the assigned activities to time intervals; (d) grouping the time intervals into complete orders; (e) seeking the scheduling of entire orders with satisfaction of all of the constraints; (f) if able to schedule entire orders, adjusting the orders within the constraints as a function of delivery cost, and reporting the schedule; (g) if unsuccessful in scheduling entire orders, dividing at least one of the complete orders into smaller groups of time intervals; (h) seeking the scheduling of the divided orders with satisfaction of all of the constraints; (i) if successful in scheduling the divided orders, adjusting the groups of time intervals within the constraints as a function of delivery cost and reporting the schedule; and (j) if unsuccessful in scheduling the divided orders, reporting the schedule with the conflicts identified.

Claim 50

A method of scheduling plural trips through a multipath system comprising the steps of: (a) identifying the activities required for each desired trip and associating the cost thereof; (b) identifying available resource; (c) assigning resources to each activity; (d) converting each activity into a time interval; (e) grouping time intervals into the desired trips; (f) scheduling entire trips; (g) dividing the trips into smaller segments if unable to schedule entire trips; and (h) scheduling segments and reporting the schedule.

Claim 51

A method of scheduling plural trips through a multipath system comprising the steps of: (a) identifying the activities required for each desired trip and associating the cost thereof; (b) identifying available resource; (c) assigning resources to each activity; (d) converting each activity into a time interval; (e) grouping time intervals into the desired trips; (f) scheduling entire trips; (g) dividing the trips into smaller segments if unable to schedule entire trips; and (h) scheduling segments and reporting the schedule.

Claim 54

A system for scheduling orders relating to the use of plural resources over time in a single system comprising: (a) means for providing data relating to: (i) the activities required to accomplish each of the orders, (ii) delivery cost associated with each of the desired orders, (iii) selected constraints, and (iv) the availability of resources; and (b) means for determining the possible assignment of available resources to each of the identified activities as a function of resource capability; (c) means for converting the assigned activities to time intervals; (d) means for grouping the time intervals into complete orders; (e) means for seeking the scheduling of entire orders with satisfaction of all of the constraints; (f) if able to schedule entire orders, means for adjusting the orders within the constraints as a function of delivery cost, and reporting the schedule; (g) if unsuccessful in scheduling entire orders, means for dividing at least one of the complete orders into smaller groups of time intervals; (h) means for seeking the scheduling of the divided orders with satisfaction of all of the constraints; (i) if successful in scheduling the divided orders, means for adjusting the groups of time intervals within the constraints as a function of delivery cost and reporting the schedule; and (j) if unsuccessful in scheduling the divided orders, means for reporting the schedule with the conflicts identified.

Claim 55

A system for scheduling orders relating to the use of plural resources over time in a single system comprising: (a) means for providing data relating to: (i) the activities required to accomplish each of the orders, (ii) delivery cost associated with each of the desired orders, (iii) selected constraints, and (iv) the availability of resources; and (b) means for determining the possible assignment of available resources to each of the identified activities as a function of resource capability; (c) means for converting the assigned activities to time intervals; (d) means for grouping the time intervals into complete orders; (e) means for seeking the scheduling of entire orders with satisfaction of all of the constraints; (f) if able to schedule entire orders, means for adjusting the orders within the constraints as a function of delivery cost, and reporting the schedule; (g) if unsuccessful in scheduling entire orders, means for dividing at least one of the complete orders into smaller groups of time intervals; (h) means for seeking the scheduling of the divided orders with satisfaction of all of the constraints; (i) if successful in scheduling the divided orders, means for adjusting the groups of time intervals within the constraints as a function of delivery cost and reporting the schedule; and (j) if unsuccessful in scheduling the divided orders, means for reporting the schedule with the conflicts identified.

Claim 58

A system for planning the movement of plural trains through a multipath railway system comprising: (a) means for developing a schedule for movement of trains using the combination of a rule based inference engine and a constraint based inference engine in which constraints generated by said rule based inference engine are provided as sequencing constraints to said constraint based inference engine; (b) means for providing the schedule and cost data relating to the trains to a procedure based inference engine for optimizing the schedule into a movement plan; (c) means for communicating the movement plan to a one of the trains; (d) a computer on the one train for determining throttle and brake settings related to the movement plan; and (e) means operatively connected to said computer for controlling the one train in accordance with said settings.

Claim 59

A system for planning the movement of plural trains through a multipath railway system comprising: (a) means for developing a schedule for movement of trains using the combination of a rule based inference engine and a constraint based inference engine in which constraints generated by said rule based inference engine are provided as sequencing constraints to said constraint based inference engine; (b) means for providing the schedule and cost data relating to the trains to a procedure based inference engine for optimizing the schedule into a movement plan; (c) means for communicating the movement plan to a one of the trains; (d) a computer on the one train for determining throttle and brake settings related to the movement plan; and (e) means operatively connected to said computer for controlling the one train in accordance with said settings.

Claim 60

A method of optimizing the movement of plural trains through a multipath railway system, comprising the steps of: (a) abstracting a model of the system to a relatively high level wherein system constraints are broadly defined; (b) optimizing the movement of plural trains through the system to provide a coarse schedule which meets the broadly defined constraints; (c) abstracting the model of the system to a relatively low level wherein system constraints are defined with particularity; and, (d) optimizing the movement of the same plural trains through the system within the constraints of the first schedule to provide a finer schedule which meets the particularly defined constraints; whereby the optimization is hierarchical in nature such that the solution space over which the search for optimizing occurs diminishes as detail is added to the model.

Claim 61

A method of optimizing the movement of plural trains through a multipath railway system, comprising the steps of: (a) abstracting a model of the system to a relatively high level wherein system constraints are broadly defined; (b) optimizing the movement of plural trains through the system to provide a coarse schedule which meets the broadly defined constraints; (c) abstracting the model of the system to a relatively low level wherein system constraints are defined with particularity; and, (d) optimizing the movement of the same plural trains through the system within the constraints of the first schedule to provide a finer schedule which meets the particularly defined constraints; whereby the optimization is hierarchical in nature such that the solution space over which the search for optimizing occurs diminishes as detail is added to the model.