Škugor, Branimir and Deur, Joško (2018) Dynamic programming versus linear programming application for charging optimization of EV fleet represented by aggregate battery. = Dynamic programming versus linear programming application for charging optimization of EV fleet represented by aggregate battery. In: 2018 SAE World Congress Experience, 10-12.04.2018., Detroit, MI, United States.
Full text not available from this repository.Abstract
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.
| Item Type: | Conference or Workshop Item (Lecture) |
|---|---|
| Keywords (Croatian): | electric vehicle; fleet; charging; optimization; aggregate battery; linear programming; dynamic programming |
| Subjects: | TECHNICAL SCIENCE > Mechanical Engineering |
| Divisions: | 900 Department of Robotics and Production System Automation > 910 Chair of Engineering Automation |
| Indexed in Web of Science: | No |
| Indexed in Current Contents: | No |
| Date Deposited: | 11 Sep 2018 10:30 |
| Last Modified: | 13 Sep 2018 06:56 |
| URI: | http://repozitorij.fsb.hr/id/eprint/8701 |
Actions (login required)
 |
View Item |
Citations:
Citations: