Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.

Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.

Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.

Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.

Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.

Abstract: Systems and methods are provided for the determination of routes from, for instance, travel segment network data associated with different data versions. More particularly, a request can be received for a route from an origin to a destination. Graph data modeling a travel segment network for a geographic region associated with the origin and for a geographic region associated the destination can be accessed. The graph data can preserve boundary nodes for visiting during a search (e.g. a contraction hierarchies style search) for a shortest path through the graph data. The reach value of a boundary segment can be considered in identifying boundary segments to be visited during the shortest path search through the graph data. The route can be determined based at least in part on the shortest path.

Abstract: A computer-implemented route planning method comprises determining source and destination nodes in a graph data structure based on a route planning query, executing an initial graph search on the graph data structure using graph costs based on real-time traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops, and computing one or more routes to the destination node from one or more of said settled nodes using precomputed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes.

Abstract: Methods and systems for determining shortest paths between a source node and a target node in a road network are disclosed. An example method includes determining a hierarchy of nodes with a number of levels of a first graph and calculating a first shortest path between the source node and the target node traversing a meeting node in the first graph. The number of levels in the first graph is reduced. One or more second shortest paths between the source node and the target node traversing one or more meeting nodes in the second reduced graph is determined. The first shortest path is assigned as a primary route and the one or more second shortest paths are assigned as alternate routes.

Abstract: A computer-implemented route planning method comprises determining source and destination nodes in a graph data structure based on a route planning query, executing an initial graph search on the graph data structure using graph costs based on real-time traffic data, wherein the initial graph search starts at the source node and settles nodes until it stops, and computing one or more routes to the destination node from one or more of said settled nodes using precomputed data based on traffic prediction data, thereby to determine a route from the source node to the destination node via one of said settled nodes.

Abstract: A public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys. At query time, since the transit information has already been processed by the system, very little computation is needed in order to fulfill the query. The system then provides users with public transit directions in response to the queries for public transit journeys.

Abstract: A public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys. At query time, since the transit information has already been processed by the system, very little computation is needed in order to fulfill the query. The system then provides users with public transit directions in response to the queries for public transit journeys.

Abstract: A public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys. At query time, since the transit information has already been processed by the system, very little computation is needed in order to fulfill the query. The system then provides users with public transit directions in response to the queries for public transit journeys.

Abstract: A public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys. At query time, since the transit information has already been processed by the system, very little computation is needed in order to fulfill the query. The system then provides users with public transit directions in response to the queries for public transit journeys.

Abstract: A method of determining a time-dependent route parameter for a transportation network, for use in an automated routing system in connection with traffic, transportation, and logistics is provided. While shortest distances from all source nodes in S to all target nodes in T are time-independent, travel times are not. The method models the transportation network and computes travel costs from an arbitrary starting node to a plurality of intermediate way-points, and from intermediate way points to the target node.

Abstract: A public transit travel planning system and methodology that uses an extensive pre-processing approach of transit information prior to query time on order to determine optimal public transit routes for journeys. At query time, since the transit information has already been processed by the system, very little computation is needed in order to fulfill the query. The system then provides users with public transit directions in response to the queries for public transit journeys.