The Additive Increase Multiplicative Decrease (AIMD) algorithm is an interesting approach in congestion control of communication networks, as it maintains the good features of a distributed strategy, without evone{sacrificing} the network stability and robustness. Recent applications of these algorithms also concern other industrial fields such as Electric Vehicles (EVs) based transportation systems, for which the introduction of an optimal charging policy is an important challenge for power systems operation. Moreover, saturation constraints on the resource allocated to each vehicle need to be taken into account in order to avoid peak power requirements and grid overloads. Optimization based AIMD algorithms with saturation constraints are proposed in this paper for public charging of EVs. Specifically, a new AIMD approach is presented in order to capture the main advantages of optimal algorithms which minimize either the sum of charging times or the operation time of each vehicle, giving rise to a mixed AIMD strategy. Simulation results illustrate the performance of the proposal, even in comparison to the corresponding centralized optimal solutions.
Optimization based AIMD saturated algorithms for public charging of electric vehicles
Nisar Shah, Saqib;Incremona, Gian Paolo;Bolzern, Paolo;Colaneri, Patrizio
2018-01-01
Abstract
The Additive Increase Multiplicative Decrease (AIMD) algorithm is an interesting approach in congestion control of communication networks, as it maintains the good features of a distributed strategy, without evone{sacrificing} the network stability and robustness. Recent applications of these algorithms also concern other industrial fields such as Electric Vehicles (EVs) based transportation systems, for which the introduction of an optimal charging policy is an important challenge for power systems operation. Moreover, saturation constraints on the resource allocated to each vehicle need to be taken into account in order to avoid peak power requirements and grid overloads. Optimization based AIMD algorithms with saturation constraints are proposed in this paper for public charging of EVs. Specifically, a new AIMD approach is presented in order to capture the main advantages of optimal algorithms which minimize either the sum of charging times or the operation time of each vehicle, giving rise to a mixed AIMD strategy. Simulation results illustrate the performance of the proposal, even in comparison to the corresponding centralized optimal solutions.File | Dimensione | Formato | |
---|---|---|---|
aimd_electric_vehicles_pub.pdf
Open Access dal 10/05/2021
Descrizione: Articolo principale
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
8.53 MB
Formato
Adobe PDF
|
8.53 MB | Adobe PDF | Visualizza/Apri |
aimd_electric_vehicles_j.pdf
Accesso riservato
Descrizione: Articolo principale
:
Publisher’s version
Dimensione
6.06 MB
Formato
Adobe PDF
|
6.06 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.