Traveling Salesman Problem

There is a salesman
He has N cities to visit.
Every city could be visited only once.
After he visited all of the N cities, he goes back to the origin.
Question: what's the shortest path?

the well-known Traveling Salesman Problem - a sad story.