This paper presents a new method relied on improved coyote optimization algorithm (ICOA) for traveling salesman problem (TSP). COA is a recent recently metaheuristic algorithm that is inspired from the social life of coyote. To improve the performance of ICOA, the 2-opt algorithm is applied to adjust created new solutions. In addition, the swapping technique with varying exchange city number is also equipped to enhance the exploration and exploitation ability of ICOA. The efficiency of the ICOA is compared with COA on the 14-, 30-, 48-, 52-, 76-and 100-city instances. The simulated results show that ICOA reaches the better results than COA for the most instances. The average error of ICOA is 0.0057%, 0.2937%, 0.0613%, 5.8431% and 49.3940% lower than that of COA for the 30-, 48-, 52-, 76-and 100-city instances, respectively. Furthermore, the maximum, average and standard deviation objective values as well as the number of convergence generations of ICOA are also lower than those of COA. Moreover, ICOA has also achieved the optimal solution with higher quality compared to the previous approaches in literature. Consequently, ICOA is one of the methods worth considering for the TSP problem.