This paper presents a self-organizing heuristic iterative algorithm for solving Travelling Salesman Problem. In the algorithm, firstly priority values of the edges are determined. Then, varied solutions are found. After that, the priority values of the edges are updated according to these solutions. Then, all the edges are sorted in descending order according to the priority values and in order to improve solutions an iterative algorithm is used. Greedy algorithm is used to find the solution in each iteration and the priority values of the edges are updated according to the solution. The proposed algorithm is compared with Nearest Neighbour and Greedy algorithm. Experimental results show that the proposed algorithm is efficient. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.