Skip to Content


Optimised routes

Find the quickest, shortest or even the most scenic route depending on the value you choose to solve for. Routes can accumulate any number of cost values such as distance, time, slope or other flow attributes. Solve for just two stop locations, or sequence many stops in the best order.

Find closest facilities

Measure the cost of travelling between incidents and facilities to determine which are nearest to one other. Specify how many to find, whether the direction of travel is toward or away and other constraints like search cutoff thresholds.

Solve multi-vehicle routing problems

Given a set of work locations and a fleet of vehicles, determine what stops should be serviced by each route and in what sequence the stops should be visited. The solution minimises the overall operating cost for the entire fleet while considering business rules you define.

Perform location allocation

The location allocation tool finds the best location for you. A right location keeps costs low and accessibility high, for maximising profit and high-quality service. The analysis takes into account facilities that provide goods and services, and where those good and services are consumed.

Generate service areas

A network service area is a region that can be reached from a location within a given travel time or travel distance. Once service areas are created, you can use them to identify how much land, how many people, or how much of anything else is within the neighborhood or region.

Create origin destination matrices

The origin destination cost matrix produces a distance table, with least-cost paths along the network from many origins to many destinations. The cost values reflect the network distance, not the straight-line distance.