Key points are not available for this paper at this time.
When it comes to long-distance trips with battery electric vehicles, recharging the battery during the journey is a crucial factor which significantly impacts the overall trip duration. The Fixed Route Electric Vehicle Charging Problem consists of finding the time optimal charging strategy on a given route. This is a complex challenge necessitating the consideration of battery constraints, heterogeneous charging infrastructure, and nonlinear charging characteristics. This study introduces an algorithm based on discrete dynamic programming taking into account all those factors. To assess its efficacy, a comparative analysis is conducted against a solver based on mixed-integer linear programming that assumes linear charging behaviors. The findings show a superior performance of the proposed discrete dynamic programming approach in terms of generating better charging strategies.
Widmann et al. (Mon,) studied this question.