Abstract: The vehicle routing problem with time window (VRPTW) is one of the routing optimization problems with capacity and time window constraints. Most of the literatures about it suppose that vehicle's speed is constant and ignore the influence of dynamic factors. We consider the speed as a time-dependent piecewise function, and use simulated annealing algorithm to solve the VRPTW under time-dependent.Experiment results show that the algorithm can solve the problem efficiently.