When use simple genetic algorithm for solving the traveling salesman problem, the generated optimal solution is over stochastic and does not consider the neighborhood information in whole search process. In order to reduce the randomness, the paper proposes a hybrid genetic algorithm which based on ant algorithm that making better use of the inspiration information of previous generations. In addition, it adds a local search process so that more useful information is supplied to get the optimal solution.