We suggest a scheme to solve a time dependent vehicle routing problem in Bangkok. In fleet transportation, we usually prefer routes aiming to minimize the number of vehicles and the total distance. However, traffic congestion has significant impact on cost and time for transportation. As traffic information in Bangkok is provided real-time in the internet, we can collect congestion levels of roads and estimate travelling times of vehicles. Based on time-dependent shortest paths between locations, we determine a route of each vehicle to minimize the total travel time, while all vehicles depart from a depot together. Our preliminary result based on the sampled data is further presented. The change of traffic situation causes ineffectiveness of routes based only on minimizing the total distance. Solving the routing problem using the traffic information can help reduce the total travel time. This study could be further applied to verify and improve the performance of logistic process.
