Dynamic routing optimization with electric vehicles under stochastic battery depletion

This paper addresses a dynamic traveling salesman problem with electric vehicles under stochastic battery depletion. In the problem, traffic density and battery consumption rate are not known precisely, and their probability distributions are subject to change during the transportation operations. The problem has been formulated and solved using the Dynamic Programming (DP) approach. We develop a DP-based heuristic, which combines Restricted DP and Prim’s algorithms, to solve larger instances. The provided algorithms can determine distribution plans that reduce energy consumption and range anxiety of electric vehicle drivers. The added values of the model and the solution approach have been shown based on a case study and 270 instance-setting pairs that involve relatively larger problems. The heuristic algorithm outperformed a benchmark heuristic by providing 6.87% lower calculated required energy on average. The provided decision support tools can be used to assure energy conservation and emission reduction for short-haul freight distribution systems.