The Traveling Salesperson Problem

A salesperson, starting at point 1 has to visit six locations (1 to 6) and must come back to the starting point. The first route (1-4-2-5-6-3-1), with a total length of 62 km, is a relevant selection but is not the best solution. The second route (1-2-5-4-6-3-1) represents a much better solution as the total distance, 48 km, is less than for the first route. This example assumes Euclidean distances and an isotropic space, but in reality the solution may be different considering the configuration of transport infrastructures.