Provides a novel hybrid ant colony algorithm combining genetic algorithm with implicit parallel function to make up the shortcomings of common ant colony alogrithm in the vehicle routing problem including slow convergence in the early stages. Introducing the encoding and mutation operation can improve the efficiency of solving the optimal distribution path. The comparative analysis of vehicle routing model and the experimental data shows that the novel hybrid algorithm has not only faster converge speed but the ability to obtain the global optimal solution in a relatively short period.