3.4.2 Travelling salesman problems The travelling salesman problem is to design optimal route through cities, an n so as to start at city 1, to visit each of the n-1 cities only and then other once, return to city 1. Let us assume a symmetrical cost matrix where cij -cji, expressing the cost in terms of Euclidean distance. Then the cost of the typical tour, i, is