1 option
Dynamic Programming Versus Linear Programming Application for Charging Optimization of EV Fleet Represented by Aggregate Battery University of Zagreb
- Format:
- Conference/Event
- Author/Creator:
- Skugor, Skugor, author.
- Conference Name:
- WCX World Congress Experience (2018-04-10 : Detroit, Michigan, United States)
- Language:
- English
- Physical Description:
- 1 online resource
- Place of Publication:
- Warrendale, PA SAE International 2018
- Summary:
- AbstractThis 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
- Notes:
- Vendor supplied data
- Publisher Number:
- 2018-01-0668
- Access Restriction:
- Restricted for use by site license
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.