The Hunter GIS Shortest Path Solution permits a web-based method of determining the minimum traveled path along a network (roads) between start and end locations (e.g. the shortest distance between two points). The solution can also determine the optimum route for traversal through a set of points in order, one-to-many, many-to-one, many-to-many and the Travelling Salesman. We can customize the Shortest path solution to your data and business requirements.
Please see our BROCHURE for more information.