The classical traveling salesman problem might be described as follows: a salesman starting from a given city, visiting each of the cities, and returning to the original point of departure should find the shortest way. More generally, he could consider in what order he should visit the cities to minimize the total distance traveled. For 'distance' we can substitute time, costs, or other measures of effectiveness as desired. Distance or costs between all city pair are presumed to be known. The authoress' version of this problem concerns two traveling salesmen SI and S2 who want to sell certain goods (commodities) in 'n' cities. The player SI starts from a city 'i' and S2 -from a city 'j' ('i' and 'j' are different and 'n' is greater than 1). Both players should visit each of (n-1) cities once and only once, and return to the starting point. The mathematical 'proposal' to minimize the travel costs is given
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.