Tour

A tour is a minimum-impedance path that starts at an origin, visits a number of stops and returns to the origin visiting the stops only once. This is the solution to the traveling salesman problem. ARC/INFO provides a heuristic solution to the traveling salesman problem by ordering the stops and then finding the least-cost path which visits them.

Any prearranged (but not necessarily prepaid) journey to one or more places and back to the point of origin.