Dynamic Programming Versus Linear Programming Application for Charging Optimization of EV Fleet Represented by Aggregate Battery

摘要

This paper deals with a thorough analysis of using two fundamentally different algorithms for optimization of electric vehicle (EV) fleet charging. The first one is linear programming (LP) algorithm which is particularly suitable for solving linear optimization problems, and the second one is dynamic programming (DP) which can guarantee the global optimality of a solution for a general nonlinear optimization problem with non-convex constraints. Functionality of the considered algorithms is demonstrated through a case study related to a delivery EV fleet, which is modelled through the aggregate battery modeling approach, and for which realistic driving data are available. The algorithms are compared in terms of execution time and charging cost achieved, thus potentially revealing more appropriate algorithm for real-time charging applications.