Skip to content
naulon
Not checkedNot checked for notices yet.

A Bi-Level EV Aggregator Coordination Scheme for Load Variance Minimization with Renewable Energy Penetration Adaptability

Saad Ullah Khan, Khawaja Khalid Mehmood, Zunaib Maqsood Haider and 2 more

Energies · 2018

doi:10.3390/en11102809 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The provision of ancillary services by electric vehicles (EVs) such as load smoothing and renewable energy (RE) compensation in the form of an aggregated storage is more regulated in the smart grid context. As such, the presence of multiple EV aggregators in the distribution network requires adept supervision by the distribution system operator (DSO). In this paper, a coordination scheme of aggregators is proposed to smoothen the load profile of distribution networks by enacting EV discharging during peak load and off-peak charging, keeping in view the EV driving requirements. A bi-level on-line interaction procedure from the DSO to the aggregators and vice versa is devised to manage the aggregators based upon their energy capacity and requirements. The aggregators employ a water-filling algorithm in a two-step EV power allocation method. The proposed scheme operation is demonstrated on an medium voltage (MV) distribution feeder located in Seoul with its actual traffic density data. The results show the achievement of peak shaving and valley filling objectives under aggregator coordination and that the EVs are completely charged before departure. The effect of various EV penetration levels and adaptivity of the scheme to RE incorporation is also verified. Furthermore, a comparison with an existing peak shaving method shows the superior performance of the proposed scheme.

Abstract licence: CC BY

References36

    36 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.