The Traveling Salesman Problem

Given a set of cities and the distances between all of those cities, the traveling salesman problem finds what is the shortest possible route that visits each city and returns to the origin city.
You may choose to input your own travel distances or calculate with randomized values.

How many cities (excluding the origin city) do you want to choose from?