Zhao, Jinli, Yu, Yingying, Li, Peng and Wu, Jianzhong ORCID: https://orcid.org/0000-0001-7928-3602 2016. A Fast Calculation Method of Energy Storage System for Distribution Network Regulation Based on Conic Programming. Dianli Xitong Zidonghua/Automation of Electric Power Systems 40 (2) , pp. 30-35. 10.7500/AEPS20150417002 |
Abstract
The energy storage system (ESS) is widely applied to enhancing renewable energy accommodation and optimizing distribution network operation. However, the optimization problem of distribution network will get more complicated when the regulation of ESS is taken into account, which makes higher requirements on the optimization algorithm. Therefore, a fast calculation method of integrating ESS into the regulation of distribution network based on conic programming (CP) is proposed. Firstly, a basic optimization model of ESS for distribution network regulation is developed. Secondly, a method is presented to convert the basic model into an equivalent conic model as the standard format of the CP required, and then the optimization problem of ESS is solved rapidly and accurately by taking advantage of the CP solver. Finally, the validity of the conic model conversion and rapidity of the CP method are demonstrated through a test example. This work is supported by National Key Technologies R&D Program (No. 2013BAA01B02) and National Natural Science Foundation of China (No. 51307116).
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Engineering |
Subjects: | Q Science > Q Science (General) |
Uncontrolled Keywords: | distribution network energy storage system (ESS) distributed generator (DG) conic programming (CP) network loss |
Language other than English: | Chinese |
Publisher: | Automation of Electric Power Systems Press |
ISSN: | 1000-1026 |
Last Modified: | 02 Nov 2022 11:51 |
URI: | https://orca.cardiff.ac.uk/id/eprint/103315 |
Citation Data
Cited 15 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
Edit Item |