Dynamic routing with real-time traffic information
- 313 Downloads
We consider the vehicle routing problem (VRP) with real-time traffic information, where stochastic intermediate times (travel times and service times) are assumed to be realized with probability distributions at the end of each customer’s service and before determining the next customer to visit. We propose a dynamic VRP (DVRP) model addressing the varying intermediate times and show that the DVRP can significantly reduce the total duration than the static or priori VRP model. To solve the DVRP model, we develop an approximate dynamic programming algorithm based on a semi-infinite linear programming, which can be derived from a class of affine time-to-go approximation functions and generate lower bound only dependent on the expected duration and the description of support set of the stochastic time vectors. We also propose a greedy heuristic time-directed policy to produce good solutions and improve computational efficiency even for the worst-case condition, and prove that it can be solved within polynomial time. The results show that our approach is of high applicability for the VRP with dynamic and real-time traffic.
KeywordsDynamic VRP Stochastic intermediate times Dynamic programming Approximation Greedy heuristic
This research is supported by the the National Natural Science Foundation of China (No. 71571023).
- Goberna MA, López MA (1998) Linear semi-infinite optimization. Wiley, Chichester, EnglandGoogle Scholar
- Powell WB (2009) Approximate dynamic programming: solving the curses of dimensionality. 2nd edn, Wiley Series in Probability and Statistics, New JerseyGoogle Scholar
- Ritzinger U, Puchinger J, Hartl RF (2015) A survey on dynamic and stochastic vehicle routing problems. Int J Product Res 54(1):1–17Google Scholar
- Sebő A (2013) Eight-fifth approximation for the path tsp. In: Integer programming and combinatorial optimization. Springer, pp 362–374Google Scholar
- Shapiro A, Dentcheva D et al (2014) Lectures on stochastic programming: modeling and theory, vol 16. SIAMGoogle Scholar