The program evaluates all possible route combinations to select the shortest tour based on a matrix of distances (or durations), either:
Since the minimum route between about ten stages is obtained in one minute, more stages can result from very long calculations (not necessarily going to the nearest location). Since the number of combinations increases exponentially with each additional step, this represents calculations in excess of a million combinations (factorial of the number of steps)!