The vehicle routing problem with time windows is a typical NPhard problem in combination optimization. An ant algorithm is proposed to deal with the vehicle routing problem with time windows in this paper. It gives a presentation for the vehicle routing problem with time windows, studies and adjusts the configuration of parameters in the ant algorithm. The experimental results indicate that the ant algorithm can effectively and quickly get the optimal resolution of VRPTW, and feature better feasibility and adaptability.