Search. A Section of the Handbook of Artificial Intelligence (1979)
Defense Technical Information Center · leaf 20
a number of cities to be visited and the mileage between each pair of cities, find a minimum-mileage trip beginning and ending at city A that visits each of the other cities exactly once. An example mileage chart and the corresponding state-space graph are shown In Figure 6. Because ! different… … State-space graph Figure 5. A traveling-salesman problem. The desired solution is A-B-D-C-A, or its reversal, with a total mileage of 26. (The two bottom levels of the graph could be omitted, since the mileage of each tour of n cities is \ determined by the first n-1 cities chosen to be visited.)…
Gardner, Anne · Stanford univ ca dept of computer science · Artificial intelligence · Algorithms · Automatic programming · Information retrieval · Natural language · Online systems · Programming languages · Searching
Internet Archive · Defense Technical Information Center · Public domain (US government work). Free to use for anything.
