A classification of travelling salesman problems into symmetric and asymmetric problems based on a suitable equivalence transformation (e.g., addition of constants by rows and columns in the distance matrix) is proposed. It is shown that an arbitrary travelling salesman problem which does not satisfy the triangle inequality can be transformed in the sense mentioned above into a problem satisfying the triangle inequality.