Back to results
US 11,455,580 B2Granted
Transit-routing expediter systems and methods for multi-modal journey optimization
AssigneeFord Global Technologies, LLC
InventorsAli Mirtar, Mohammad Abouali, Shengjie Tu, Adam David DeJans, Jr.
Life of this patent
Estimating the term…
Abstract
Transit-routing expediter systems and methods for multi-modal journey optimization are disclosed herein. An example method includes determining journey parameters having an origin location, a destination location, and a time of departure; determining paths based on the journey parameters, each of the paths including any combination of route-based options, non-route-based options, or walking options; determining arrival times of the paths relative to the destination location; and identifying a set of solutions for the paths based on the arrival times using an iterative analysis.
Claims5
A method, comprising:
- determining stops based on an origin location, a destination location, and a time of departure, the stops including route-based transit options, non-route-based transit options, and walking options;
- determining which of the stops are valid;
- determining sequences of the valid stops that create paths that each comprise an arrival time, a first path of the paths comprising a portion of the valid stops, wherein the valid stops comprise the route-based transit options and the non-route-based transit options, wherein the non-route-based transit options include at least one of a bicycle service, a scooter service, or another on-demand or a point-to-point transit service that does not operate according to a schedule, wherein determining sequences of the valid stops comprises iteratively evaluating possible sequences of stops by incrementally adding a stop at each iteration when a transit option has been used;
- identifying a set of solutions for the paths, including the first path, based on the arrival times;
- selecting a walking option when the walking option has an arrival time to the destination location that is earlier than an arrival time at the destination for the route-based transit options or the non-route-based transit options;
- selecting one of the valid stops based on an earliest stop arrival time or a lowest number of stops, wherein selecting one of the valid stops further comprises:
- generating a first fixed-length priority queue for each of the valid stops of one of the paths, and
- iterating through the first fixed-length priority queues by increasing a number of valid stops until a set of solutions are determined,
- wherein when the stop arrival time is updated, the method further comprises:
- comparing the arrival time for the destination location to the stop arrival time;
- and
- determining when the valid stop is marked for review in a subsequent iteration
- wherein determining when the valid stop is marked for review in the subsequent iteration comprises establishing a second fixed-length priority queue for the destination location that comprises a portion of the paths, further wherein when the second fixed-length priority queue is not full, the valid stop that is currently being evaluated is marked for review in the subsequent iteration.
10 more elements
A transit-routing expediter system, comprising:
- a processor;
- and
- a memory for storing instructions, the processor executing the instructions to:
- receive an origin location, a destination location, and a time of departure;
- determine marked stops within walking distance of the origin location;
- determine additional stops selected from a route-based transit option, a non-route-based transit option, and a walking option relative to the marked stops and the destination location to create paths, wherein a first path of the paths comprising a marked stop of the marked stops and a portion of the potential stops, the first path connecting the marked stop to the destination location
- determine arrival times for the paths, including the first path;
- and
- transmit the paths to a mobile device of a commuter,
- wherein the processor is configured to determine additional stops through an iterative process comprising:
- selecting one of the additional stops based on an earliest stop arrival time or a lowest number of stops;
- generating a first fixed-length priority queue for each of the additional stops selected;
- iterating through the first additional stops until a set of solutions are determined,
- wherein when the stop arrival time is updated:
- comparing the arrival time for the destination location to the stop arrival time;
- and
- determining when one of the additional stops is marked for review in a subsequent iteration by establishing a second fixed-length priority queue for the destination location that comprises a portion of the paths, further wherein when the second fixed-length priority queue is not full, a current stop is marked for review in the subsequent iteration, wherein when a new arrival time of the current stop occurs before a latest arrival time to the destination location, the current stop is marked for review in a subsequent iteration.
14 more elements
Dependencies are inferred from the claim text.