Tan, Lee, Zhu, and Ou , 1999 Presentation of problems arranging transport routes by the time frame (for Vehicle Routing Problem with Time Windows VRPTW:) by the time the car can run per one path every car with minimum expense and must not. Abuse of maximum load of each car, and up-to-date on each customer receipt time period with the objective to find the edges of the time to transport goods, appropriate to make transport costs, low down.