Read the explanation
The saved tour tool sums straight-line haversine distances between consecutive stops, multiplies by one point one eight and rounds. It does not query road routing. For an illustrative one hundred straight-line miles, the estimate becomes one hundred eighteen driving miles. Bars share two pixels per mile, widths two hundred and two hundred thirty six. Hours divide the rounded distance by selected speed and round again. At sixty miles per hour, one hundred eighteen divided by sixty rounds to two driving hours. A constant eighteen percent winding factor cannot establish a real driving route, road conditions or journey duration. The sequence is an open path; no closing return leg is added by this loop. Cost combines estimated driving miles times cost per mile with twenty two hundred per stop. For illustrative one hundred eighteen miles, cost per mile four point five and three stops, the result is five hundred thirty one plus sixty six hundred, or seventy one hundred thirty one. Tour days separately use the larger of stop count and rounded stop count times one point two five. Three stops give four days; four stops give five. Bars share sixty pixels per day, widths two hundred forty and three hundred. Although the comment mentions travel hours divided by four, the actual tour-days expression does not use travel hours. Changing speed affects the hours label, not this duration rule. These are authored planning assumptions, not a quote or verified itinerary. The optimize function retains the first stop and repeatedly chooses the nearest remaining stop by its straight-line distance. For an illustrative last point with two candidate distances ten and twelve miles, the ten-mile candidate wins. Bars share twenty pixels per mile, widths two hundred and two hundred forty. This greedy local choice does not prove minimum total route distance. Equal-distance ties keep the earlier unvisited item because the comparison is strictly less than. After reordering, days are assigned by rounded one point two times one-based index, giving one, two and four for the first three. The optimizer changes order and day labels; it does not solve road routing, appointment constraints or real travel feasibility. Source claims about minimized transit require stronger evidence than this heuristic.