Ant Colony Algorithm（ACA） is a novel simulated evolutionary algorithm which shows many promising properties and can solve Traveling Salesman Problem（TSP） efficiently. On the basis of analyzing the difference between VRP and TSP, an Adaptive Hybrid Ant Colony Algorithm（AHACA） is proposed to solve VRP, which is improved from basic ACA by improving the basic rules and integrating 2-opt local search method and C-W algorithm in order to decrease computing time and avoid stagnation behavior of basic ACA. Moreover, the problem of acquiring feasible solution is also discussed, and four resolutions such as Mass Ant, Feasibility Process of Approximate Solutions etc. are also introduced. Simulation results show that the AHACA is feasible and valid for VRP