In this paper, an improved 2-optimization(2-opt) and Ant Colony Optimization (ACO) Hybrid Algorithm is proposed to solve the Traveling Salesman Problem (TSP). The improved scheme of ACO is to define the indirect expectation heuristic and introduce it into the calculation method of transition probability, which will reduce the effect of pheromone on ant selecting path and increase the path's diversity of ACO. In this way, the deficiency of ACO in convergence to local optimal solution will be made up. Considering of the stronger local search ability, 2-opt algorithm is used to optimize existing solutions, and the better solution is obtained. Finally, the performance of the proposed algorithm is evaluated by the classical TSP problem.