One of the most commonly used routing algorithms is Dijkstra’s algorithm. Dijkstra’s algorithm finds the shortest path between two nodes by building a shortest-path tree, and stopping once the destination node has been reached. Normally in routing applications, Dijkstra’s algorithm is used to find the shortest route between 2 locations. This is the case with Map Suite Routing’s built-in Dijkstra routing algorithm. However, there may be instances where you may want to find the shortest path from a single source node to several destination nodes. Continue reading
Tag: traveling salesman problem
The Map Suite Routing Extension allows you to add intelligence to your GIS app by adding route mapping and driving direction functionality. It supports many common routing scenarios as previously described here. A common scenario is the Traveling Salesman Problem (TSP) which allows you to generate the optimal sequence for visiting multiple locations.
The TSP scenario was always supported by Map Suite Routing Extension; however, improvements have been made to the algorithm which allows developers to work with more stops and more accurate results than before. Continue reading