An old application of the TSP is to schedule the collection of coins from payphones throughout a given region.  A modified version of Concorde's Chained Lin-Kernighan heuristic was used to solve a variety of coin collection problems.  The modifications were needed to handle 1-way streets and other features of city-travel that make the assumption that the cost of travel from x to y is the same as from y to x unrealistic in this scenario.