Method and System for Holistic Transportation Routing

• US 20170325068A1
• Filed: 05/09/2016
• Published: 11/09/2017
• Est. Priority Date: 05/09/2016
• Status: Abandoned Application

• Current Assignee: Leonard Bertelli
• Original Assignee: Leonard Bertelli
• Inventors: Bertelli, Leonard
• Application Number:
  US15/149,209
• Publication Number:
  US 20170325068A1
• Time in Patent Office: Days
• CPC Class Codes: H04W 4/021 Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
• CPC Class Codes: H04W 4/025 using location based information parameters

Abstract

A method for improving transportation routing offers better performance and greater control over current methods based on injecting domain specific metrics. What is new is the method starts with optimizing small sub-routes from a comprehensive list of all geographic locations that can be routed. This is similar to geometry node contraction but in this case it contracts sub-routes. Every location pair combination is routed and only the best results are saved. These sub-routes are then queried and combined when a user or system provides a set of locations to be routed. What is also new is that this method uses data configurations specific to a type of transportation to enable the optimization to control performance, data size, and routing flexibility.

Claims

1. A method for producing a contracted list of route legs from a comprehensive set of geographic locations that are optimized for distance and other metrics, the method comprising:

a comprehensive set of geographic locations are all the latitude/longitude positions within a particular domain;

domain specific geographic locations represent all locations where a type of service can be performed and the route legs that can support that type of service;

generating a number of location-to-location route legs with domain data associated with the route legs for subsequent querying;

generating a number of location-to-location route legs with alternate path route legs to avoid constraints identified in domain metrics to be used for subsequent querying;

each location-to-location route leg has a start point, an end point, and turn-by-turn instructions, time, distance, one-way streets, waypoint identifier, direction, alternatives, and driving instructions;

each route leg forms a node in a compaction hierarchy; and

maintaining domain tables to contain all route legs in the compaction hierarchy that are to be subsequently combined to make a complete route.

2. A method for routing a subset of the comprehensive set of locations by using the contracted list of route legs, the method comprising:

a request is an invocation from a communications device to generate a route and contains the information that is used by the method to generate a route;

in response to receiving a request from a communications device, a list of geographical locations that need to be routed together which may include parameterized metrics in the request, that are specific to a particular domain;

the number of the list of geographic locations can be as few as 2 being start-point/end-point to the full set of all geographic locations;

generating a complete route by using the list of geographical locations to search the compaction hierarchy for an optimized result;

an optimized result may be based on but not limited to total time, total distance, or total trip cost based on parameterized metrics in the request;

parameterized metrics provide selection refinement on domain metrics for selection of route legs

a list of more than 2 geographic locations would result in a route that has waypoints;

generating a table to transmit to or make available to a communications device, the user that requested the route, to contain but not limited to a list of route segments with turn-by-turn instructions, time, distance, one-way streets, waypoint identifier, direction, alternatives, and driving instructions; and

generating a route summary to or make available to a communications device, the user that requested the route, to contain but not limited to a total time, total distance, total trip cost based on parameterized metrics in the request, start point, and end point.