System and method for determining routing information
First Claim
1. A system for determining an optimal set of routes from an origin location to one or more destination locations comprising:
- a reverse geo-code database of closest intersections for a set of one or more locations of a particular geographical region;
a matrix generator for creating a set of shortest paths among the possible paths between the origin location and the one or more destination locations wherein the shortest paths are determined by calculating a first shortest distance from a first location to a first nearest artery, a second shortest distance from a second location to a second nearest artery, a third shortest distance from the first nearest artery to the second nearest artery, and combining the first shortest distance, the second shortest distance, and the third shortest distance; and
a vehicle routing problem solver for generating an optimal set of routes connecting the one or more destination locations by combining the one or more shortest paths.
1 Assignment
0 Petitions
Accused Products
Abstract
A system and method for determining an optimal set of routes from an origin to one or more destinations. The system comprises a reverse geo-code database of closest intersections for one or more locations of a particular geographical region, a matrix generator, and a vehicle routing problem solver. The matrix generator creates a set of shortest routes among the possible routes between the origin location and the one or more destination locations. The shortest routes are determined by calculating a distance from a first location to a first nearest artery, a distance from a second location to a second nearest artery, and from the first nearest artery to the second nearest artery. The vehicle routing problem solver generates an optimal set of routes connecting the one or more locations by combining the one or more shortest routes.
-
Citations
20 Claims
-
1. A system for determining an optimal set of routes from an origin location to one or more destination locations comprising:
-
a reverse geo-code database of closest intersections for a set of one or more locations of a particular geographical region; a matrix generator for creating a set of shortest paths among the possible paths between the origin location and the one or more destination locations wherein the shortest paths are determined by calculating a first shortest distance from a first location to a first nearest artery, a second shortest distance from a second location to a second nearest artery, a third shortest distance from the first nearest artery to the second nearest artery, and combining the first shortest distance, the second shortest distance, and the third shortest distance; and a vehicle routing problem solver for generating an optimal set of routes connecting the one or more destination locations by combining the one or more shortest paths. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method for determining an optimal set of routes linking an origin location and one or more destination locations performed by a special-purpose computer programmed by an application software module comprising:
-
creating a set of shortest paths among each of the one or more possible paths between the origin location and the one or more destination locations, wherein the shortest paths are determined by calculating a first shortest distance from a first location to a first nearest artery, a second shortest distance from a second location to a second nearest artery, a third shortest distance from the first nearest artery to the second nearest artery, and combining the first shortest distance, the second shortest distance, and the third shortest distance; and generating an optimal set of routes connecting the one or more destination locations by combining the one or more shortest paths. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A system for determining an optimal set of routes from an origin location to one or more destination locations comprising:
-
means for creating a set of shortest paths among the possible routes between the origin location and the one or more destination locations wherein the shortest paths are determined by calculating a first shortest distance from a first location to a first nearest artery, a second shortest distance from a second location to a second nearest artery, a third shortest distance from the first nearest artery to the second nearest artery, and adding the first shortest distance, the second shortest distance, and the third shortest; and means for generating an optimal set of routes connecting the one or more locations by combining the one or more shortest paths. - View Dependent Claims (20)
-
Specification