Brief

This product is a computational engine that uses advanced algorithms for finding shortest routes on a map of streets/roads. It allows the users to solve the following tasks:

Shortest (either by travel distance or by travel time) route(s):

• from a single origin to a single destination
• from a single origin to multiple destinations
• from a multiple origin to single destinations
• from a multiple origin to three nearest destinations (out of many)

Reachability analysis

• regions of reachability – street coverage by closest (out of many) origin (destination).
• isolines of equal travel distances from origin (to destination).

Each task can be optimized either by travel time or by distance, taking into account delays due to turns or road crossings and additional constraints, such as maximal allowed vehicle height, width or weight can be applied. Some tasks can be additionally optimized to use a road of the highest class (e.g. roadway, highway, speedway) at first or have additional constraints, such as time and distance limits. Performance of the computations can be improved by saving pre-calculated data for known (permanent) origins/destinations.

Architecture

The Engine is available as a standalone executable accessible via COM interface, or a library that can be embedded into other desktop or web applications.