As is well known, the inversion in genetic algorithm has no lethal and is effective for solving kinky in TSP (traveling salesman problem). But detail for the inversion has not been cleared. After, we categorize the inversion into the three types according to exchange area of gens; We show the fore methods to select the individual for new generation. Also through solving the traveling salesman problems, we compare the mean convergence ratio among inversion, OX, and MPX.