Abstract: GA (Generation Algorithm) and ACO (Ant Colony Optimization) are two powerful and effective algorithms for solving the combination optimization problems. Recent researches indicate that ACO has high robustness and better ability for searching optimal results. On the base of analysis regarding the two algorithms, their advantages and disadvantages are given by means of large numbers of experiments respectively. Some future research suggestions are provided.