Distributed real-time pricing method incorporating load uncertainty based on nonsmooth equations for smart grid (Q2298073)

From MaRDI portal
Revision as of 18:56, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Distributed real-time pricing method incorporating load uncertainty based on nonsmooth equations for smart grid
scientific article

    Statements

    Distributed real-time pricing method incorporating load uncertainty based on nonsmooth equations for smart grid (English)
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    Summary: The real-time pricing mechanism of smart grid based on demand response is an effective means to adjust the balance between energy supply and demand, whose implementation will impact the user's electricity consumption behaviour, the operation, and management in the future power systems. In this paper, we propose a complementarity algorithm to solve the real-time pricing of smart grid. The Karush-Kuhn-Tucker condition is considered in the social welfare maximisation model incorporating load uncertainty to transforming the model into a system of nonsmooth equations with Lagrangian multipliers, i.e., the shadow prices. The shadow price is used to determine the basic price of electricity. The system of nonsmooth equations is a complementarity problem, which enables us to study the existence and uniqueness of the equilibrium price and to design an online distributed algorithm to achieve the equilibrium between energy supply and demand. The proposed method is implemented in a simulation system composed of an energy provider and 100 users. Simulations results show that the proposed algorithm can motivate the users' enthusiasm to participate in the demand side management and shift the peak loading. Furthermore, the proposed algorithm can improve the supply shortage. When compared with an online distributed algorithm based on the dual optimisation method, the proposed algorithm has a significantly lower running time and more accurate Lagrangian multipliers.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references