Starting Network Analysis > Network Analysis Solution

Superior Route

Superior Route finds an optimal route from the start point to the end point in the network system, and finds the optimal solution for the Traveling Salesman Problem. Traveling Salesman Problem is an ancient mathematical problem with high practical value. It describes a salesman plans to visit his customers in different places and comes back to the company. The problem is “”How to plan the visiting order and route so that the salesman could finish the visiting in the shortest time?”

In Superior Route, based on the cost type (time= the quickest path, distance=the shortest path) an optimal route that has the least accumulative cost will be planned by setting the location, order, time window of stops and by following the network conditions(turn, vehicle weight, vehicle height).