PROJECT TITLE :

Hierarchical Demand Response for Peak Minimization Using Dantzig–Wolfe Decomposition

ABSTRACT:

Demand response (DR) algorithms manipulate the energy consumption schedules of controllable masses therefore as to satisfy grid objectives. Implementation of DR algorithms employing a centralized agent can be problematic for scalability reasons, and there are problems connected to the privacy of data and robustness to communication failures. Thus, it's desirable to use a scalable decentralized algorithm for the implementation of DR. During this paper, a hierarchical DR scheme is proposed for peak minimization based mostly on Dantzig–Wolfe decomposition (DWD). In addition, a time weighted maximization choice is included in the value operate, which improves the standard of service for devices seeking to receive their desired energy sooner instead of later. This paper also demonstrates how the DWD algorithm can be implemented additional efficiently through the calculation of the upper and lower price bounds when every DWD iteration.