GeoBase does not directly solve enterprise routing problems (e.g. 10 vehicles, 100 stops). These problems are known as NP-Hard problems - essentially, there is no way to find the very best solution without trying every single possiblity and comparing the results. Because this is not practical for more than a dozen or so stops, other methods must be used to arrive at a solution that, while not optimal, is still a good solution for the problem.
The techniques to simplify the problem connot be selected without knowing specific details of the type of route to be solved. For example, a garbage truck that has to pass by both sides of a street will have a different optimal route than a delivery vehicle making a couple of stops spread throughout a city. See below for a more detailed explanation.
GeoBase can form a component of these solutions by solving the spatial problem through the use of the RouteMatrix function sets. The spatial information is coupled with business application specifics (driver capability, truck inventory, delivery windows, etc) to narrow the problem so it can be solved in a reasonable amount of time.
GeoBase is used in a number of enterprise routing applications. Read more about GeoBase route optimzation.
