This paper suggests a hybrid genetic algorithm for asymmetric traveling salesman problem(TSP). The TSP was proved to be NP-complete, so it is difficult to find optimal solution in reasonable time. Therefore it is important to develope an algorithm satisfying robustness. The algorithm applies dynamic programming to find initial solution. The genetic operator is uniform order crossover and scramble sublist mutation. And experiment of parameterization has been performed.