Abstract: Vehicle Routing Problem(VRP) is a difficult NP problem. Ant colony algorithm is an effective approach to solve vehicle routing arrangements and combinatorial optimization problems. This article analyzes the application of ant colony algorithm to solving VRP problems, and proposed an improvement for the traditional ant swarm algorithm with heuristic function, and to optimize the traditional ant colony algorithm. The verification experiment showed that the proposed algorithm performed better than the traditional ant colony algorithm.