Research on bi-level cooperative robust planning of distributed renewable energy in distribution networks considering demand response and uncertainty
Xin Zhao, Zhenqi Bai, Wanlei Xue and 3 more
Energy Reports · 2021
doi:10.1016/j.egyr.2021.09.170 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The pressure of climate change and carbon emission reduction has promoted the rapid development of distributed renewable energy. One of the problems is how to connect to the distribution grid economically, efficiently and safely and to achieve the consumption of renewable energy. Meanwhile, the demand response of customers is also an important resource that can be regulated by the distribution grid. Based on this, a bi-level cooperative robust planning model for distributed renewable energy in the distribution grid considering demand response is constructed. In the first layer plan, the position and capacity of distributed renewable energy access is used as decision variables, and the minimum operation cost of the distribution network is minimized. In the second layer plan, the uncertainty of the output of renewable energy is further considered. Aiming at the optimal operating cost of the system and combining with relevant constraints, the lower-level robust optimization model is established by introducing robust optimization, and the optimization iteration is carried out by using SSA algorithm. Finally, the model and the method are verified by an example simulation, and the influence of demand response on the planning results is analyzed. The results show that considering the demand response in the distribution network planning is beneficial to delay the investment cost, enhance the power users’ load flexibility, and effectively avoid load cutting and other problems. The introduction of robust optimized two-level collaborative planning model can effectively promote the consumption of renewable energy and promote the participation of demand response resources in planning.
Abstract licence: CC BY-NC
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.