The genetic optimization (GO) is employed to solve the Traveling Salesman Problems (TSP). Instead of the global fitness of the individuals, it calculates the local fitness of each gene in GO. Based on the local fitness, worse gene are selected and modified for better fitness. With the improvement of local fitness, the global fitness is improved. The algorithm is implemented for well-known benchmark cases, and the simulation results have shown the infeasibility and effectiveness of the algorithm.