The traveling salesman problem (TSP) is one of the most widely studied NP hard combinatorial optimization problems and has already solved in the semi-optimal manners using numbers of different methods. Among them, Genetic Algorithms (GA) is pre-dominating. In this paper I solve the problem with a new operator, Inver-over, for an evolutionary algorithm for the TSP. This operator outperforms all other genetic operators, whether unary or binary, which was first introduced by Guo Tao and Zbigniew Michalewicz. I also propose a new algorithm for solving TSP and also introduced it modified version....