2015
DOI: 10.1016/j.ijepes.2014.12.084
|View full text |Cite
|
Sign up to set email alerts
|

Optimal power flow of a distribution system based on increasingly tight cutting planes added to a second order cone relaxation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
61
0
1

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 60 publications
(62 citation statements)
references
References 23 publications
0
61
0
1
Order By: Relevance
“…(26) and setting fixed the set J st as seen in eq. (27). The final resulting ideal sizing is found in Fig.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…(26) and setting fixed the set J st as seen in eq. (27). The final resulting ideal sizing is found in Fig.…”
Section: Resultsmentioning
confidence: 99%
“…An example of this could be high PV production and low loads during the summer season. In order to overcome the challenge of inaccurate convex relaxations [27] presents an AC OPF algorithm that integrates linear cuts implemented in an iterative manner to ensure an exact and feasible relaxation of the power flow equations. In a followup work, this algorithm has then been developed into a multi-temporal one in order to more objectively evaluate the benefits of grid connected storage and other temporally dependent variables in [28].…”
Section: Introductionmentioning
confidence: 99%
“…In 2015, Abdelouadoud et al [14] presented a second-order cone (SOC) relaxation algorithm to solve OPF based on a branch flow model of a radial and balanced distribution system. In 2016, Baran and Fernandes [15] presented a three-phase OPF, which includes the mutual impedances in order to minimize the losses of system.…”
Section: Uncategorised Mathematical Techniquesmentioning
confidence: 99%
“…Moreover, we develop an efficient gradient descentbased method to update the predictive model parameter. This method is more efficient than the most popular optimization algorithm used in structured output prediction methods, cutting plane algorithm [6,8,7,1], because it avoids the time-consuming quadratic programming problem of cutting plane algorithm.…”
Section: Our Contributionsmentioning
confidence: 99%
“…We summarize the developed iterative learning algorithm in Algorithm (1). From this algorithm, we can see that the iterations are repeated T times.…”
Section: Iterative Algorithmmentioning
confidence: 99%