traveling salesman

Does your organization provide services in the community regularly?  Do you have regular routes of sites to visit: neighborhood elderly, community centers, or even regular errand runs?  There are many situations when a local nonprofit or community organization needs to plan a logical route between multiple locations in a city or region.  But what's the most efficient route when you have several - or a dozen - sites to visit?

In the computer science world, this is a classic computational challenge that programmers have long studied, referred to as the "traveling salesman problem" because of its original context: given the distances between each city, what is the most efficient route between a number of cities, so that you visit each city once and only once?