Transportation scheduling system
First Claim
1. A computer-implemented method of generating a schedule for a transportation operation, comprising:
- a) providing an ordered list of a plurality of demands for transportation between a plurality of origins and a plurality of destinations, each demand being associated with an origin, a destination and a departure time or arrival time;
using a computer to;
b) set a schedule fragment to satisfy one of the demands in the ordered list, the step of setting the schedule fragment including assigning resources from one or more lists of available resources, and c) modifying the one or more lists of available resources to indicate a revised state based on the use of resources in step (b); and
d) repeating steps (b) and (c) so that steps (b) and (c) are performed for the plurality of demands according to the order of the demands in the list and so that step (b) for each demand is performed using the state resulting from step (c) for the next previous demand.
4 Assignments
0 Petitions
Accused Products
Abstract
Methods for scheduling a transportation operation such as the operation of an airline. The method desirably selects a demand (100) for transportation specifying an origin, destination, and time of arrival or departure, and selects resources from a database of available resources such as aircraft (508), crew, and departure gates. The resource selection desirably is conducted so as to optimize a result function such as contribution to margin or other financial result from the particular operation specified in the demand. Upon developing a schedule fragment (108), the specified resources are committed, and the database of available resources is modified (110) to indicate that the resources are no longer available at the relevant times. The system then treats another demand and repeats the process so as to develop a full schedule. The system can develop a feasible schedule, even for a complex transportation operation in a brief time, typically in minutes or less. Schedules can be developed using alternative strategies and assumptions, and tested against one another.
-
Citations
50 Claims
-
1. A computer-implemented method of generating a schedule for a transportation operation, comprising:
-
a) providing an ordered list of a plurality of demands for transportation between a plurality of origins and a plurality of destinations, each demand being associated with an origin, a destination and a departure time or arrival time;
using a computer to;
b) set a schedule fragment to satisfy one of the demands in the ordered list, the step of setting the schedule fragment including assigning resources from one or more lists of available resources, and c) modifying the one or more lists of available resources to indicate a revised state based on the use of resources in step (b); and
d) repeating steps (b) and (c) so that steps (b) and (c) are performed for the plurality of demands according to the order of the demands in the list and so that step (b) for each demand is performed using the state resulting from step (c) for the next previous demand. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 48, 50)
-
-
35. A computer-implemented method of generating a schedule for a transportation operation, comprising:
-
a) providing a list of a plurality of demands for transportation between a plurality of origins and a plurality of destinations, each demand being associated with an origin, a destination and at least one of a departure time and an arrival time, and a list of resources including a plurality of vehicles and information specifying location of each vehicle versus time;
using a computer for;
b) selecting a vehicle from the vehicles identified in the list of resources;
c) selecting one of the demands from the list of the demands and setting a schedule fragment to satisfy the selected demand by assigning the selected vehicle to the selected demand, and d) modifying the list of resources and list of demands to indicate a revised state based on the use of vehicles and demands in step (c); and
e) repeating steps (b) through (d) so that steps (b) through (d) are performed for the plurality of demands and so that step (c) for each repetition is performed using the state resulting from step (d) for the next previous repetition. - View Dependent Claims (36, 37, 38, 39, 40, 41, 42, 43)
-
-
44. A scheduling system for a transportation operation, comprising:
-
a) at least one input node operable to receive input information at least partially defining services to be provided in the transportation operation;
b) a computer connected to the at least one input node so that input information received by the input node will be supplied to the computer, the computer being operable in response to the input information to;
(1) maintain an ordered list of a plurality of demands for transportation between a plurality of origins and a plurality of destinations, each demand specifying a particular origin, a particular destination and at least one of a time for departure from the particular origin and a time for arrival at the particular destination;
(2) set a schedule fragment to satisfy one of the demands in the ordered list, the step of setting the schedule fragment including assigning resources from one or more lists of available resources, the step of setting the schedule fragment being performed so that a result function for the schedule fragment meets one or more criteria;
(3) modify the one or more lists of available resources to indicate a revised state based on the use of resources in step (2); and
(4) repeating steps (2) and (3) so that steps (2) and (3) are performed for the plurality of demands according to the order of the demands in the list and so that step (2) for each demand is performed using the state resulting from step (3) for the next previous demand; and
c) at least one output node connected to the computer so that output information representing at least some of the resources assigned to schedule fragments will be supplied to the at least one output node. - View Dependent Claims (45, 47)
-
-
46. A scheduling system for a transportation operation, comprising:
-
a) at least one input node operable to receive input information at least partially defining services to be provided in the transportation operation;
b) a computer connected to the at least one input node so that input information received by the input node will be supplied to the computer, the computer being operable in response to the input information to;
(1) maintain a list of a plurality of demands for transportation between a plurality of origins and a plurality of destinations, each demand being associated with an origin, a destination and a departure from or arrival time and one or more lists of resources including a plurality of vehicles and information specifying location of each vehicle versus time;
(2) select a vehicle from the one or more vehicles identified in the list of vehicles;
(3) select one of the demands from the list of the demands and set a schedule fragment to satisfy selected demand by assigning the selected vehicle to the selected demand;
(4) modify the one or more lists of vehicles and list of demands to indicate a revised state based on the use of vehicles and demands in step (3); and
(5) repeat steps (2) through (4) so that steps (2) through (4) are performed for the plurality of demands and so that step (3) for each repetition is performed using the state resulting from step (4) for the previous repetition. - View Dependent Claims (49)
-
Specification