The travel itinerary for an executive of a non-profit
organization was computed using Concorde's TSP solver. The trip involved
a chartered aircraft to visit cities in the 48 continental states plus
Washington, D.C. (Commercial flights were used to visit Alaska and
Hawaii.) It would have been nice if the problem was the same as that
solved in 1954 by Dantzig, Fulkerson, and Johnson, but different cities
were involved in this application (and somewhat different travel costs,
since flight distances do not agree with driving distances). The
data for the instance was collected by Peter Winker of Lucent Bell Laboratories.
Next Application
|