Traveling salesman problem (TSP) is a problem whose solution is applicable in many engineering problems. We propose a new method of solving the TSP in this article. New technique inspired by eurygasters movement. Eurygasters attack to grain farms and distributed over them. It is worth to mention that these insects attack to farms in groups and each group colonize in one farm. It is observed that after periods of time all of the farms in a region are occupied by these groups of eurygasters. We also make experiments using the 7 data sets obtained from the TSPLIB and compare the experimental results with other nature-inspired algorithms such as simulated annealing and ant colony system. Experimental results show that the proposed algorithm is fairly good.
