Tuning a schedule of transportation resources using mathematical programming
First Claim
Patent Images
1. An article comprising a machine-readable medium storing instructions for generating a refined schedule for a network of transportation resources, the instructions causing a data processing apparatus to perform operations comprising:
- identifying an original schedule including a set of original routes, each of the original routes including a plurality of segments, and each segment in each of the original routes having an associated original departure or arrival window;
expanding the original departure or arrival window associated with a plurality of the segments;
identifying alternative candidate routes based on the expanded departure or arrival windows, wherein at least one of the alternative candidate routes includes a different set of segments than a corresponding original route in the original schedule;
evaluating the alternative candidate routes by using mathematical programming to determine a score for each alternative candidate route based on an objective function; and
selecting a refined schedule including at least one of the alternative candidate routes, the refined schedule selected based at least in part on the scores for the alternative candidate routes.
1 Assignment
0 Petitions
Accused Products
Abstract
Techniques for refining a schedule involve identifying schedule alternatives to an original schedule and generating one or more substitute schedules using one or more of the schedule alternatives. An objective function is used to perform an analysis of the original schedule and the one or more substitute schedules, and a refined schedule is selected based on the analysis.
30 Citations
22 Claims
-
1. An article comprising a machine-readable medium storing instructions for generating a refined schedule for a network of transportation resources, the instructions causing a data processing apparatus to perform operations comprising:
-
identifying an original schedule including a set of original routes, each of the original routes including a plurality of segments, and each segment in each of the original routes having an associated original departure or arrival window; expanding the original departure or arrival window associated with a plurality of the segments; identifying alternative candidate routes based on the expanded departure or arrival windows, wherein at least one of the alternative candidate routes includes a different set of segments than a corresponding original route in the original schedule; evaluating the alternative candidate routes by using mathematical programming to determine a score for each alternative candidate route based on an objective function; and selecting a refined schedule including at least one of the alternative candidate routes, the refined schedule selected based at least in part on the scores for the alternative candidate routes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A computer-implemented method for generating a refined schedule, the method comprising the following steps performed by one or more processors:
-
identifying an original schedule including routes to be traveled by transportation resources, each of the routes including a plurality of segments, and each segment in each of the original routes having an associated original departure or arrival window;
identifying alternative candidate routes based on expanded departure or arrival windows associated with a plurality of the segments, wherein at least one of the alternative candidate routes includes a different set of segments than a corresponding route in the original schedule;evaluating the alternative candidate routes by using mathematical programming to determine a score for each alternative candidate route based on an objective function that quantifies a desirability of at least one schedule characteristic; and selecting a refined schedule including at least one of the alternative candidate routes, the refined schedule selected based at least in part on the scores for the alternative candidate routes. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
Specification