tspPath
Description: The tspPath resource. This page simulates how to perform traveling salesman analysis using REST interfaces. Traveling salesmen problem analysis (TSP) is to find the path passing a series of specified nodes. The TSP is an unordered path analysis. The Traveling salesmen can determine the order of accessing the nodes for themselves, in order to get the traveling path with the minimum (or close to minimum) impedance. If the end point has been specified, the end point must be the last one to be accessed by the traveling salesmen, and the order of accessing other points can be flexible. |