带时间窗的车辆路径问题是一个典型的NPHard问题，本文将蚂蚁算法应用于带时间窗车辆路径问题，构造了该问题的表达方法，建立了相应的算法模型，对算法参数进行了分析并提出了相应的参数改进方案。仿真实验表明，改进后的算法可以快速、有效地求解带时间窗车辆路径问题，具有较好的可行性和适用性。

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.