Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years. It has been paid much attention to since the successful application in the famous traveling salesman problem. This paper further extends the idea of this new biological optimization strategy to vehicle routing problem with time windows in logistic management and designs a new kind of dynamic ant algorithm. The ability of optimization of this new ant algorithm is tested through numerical computation which gives encouraging results.