2022
DOI: 10.3390/math10193649
|View full text |Cite
|
Sign up to set email alerts
|

Recursive Convex Model for Optimal Power Flow Solution in Monopolar DC Networks

Abstract: This paper presents a new optimal power flow (OPF) formulation for monopolar DC networks using a recursive convex representation. The hyperbolic relation between the voltages and power at each constant power terminal (generator or demand) is represented as a linear constraint for the demand nodes and generators. To reach the solution for the OPF problem a recursive evaluation of the model that determines the voltage variables at the iteration t+1 (vt+1) by using the information of the voltages at the iteration… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 31 publications
0
4
0
Order By: Relevance
“…Here, a linear approximation is presented which is based on the convex OPF approach recently reported in [29] for obtaining a convex equivalent formulation of the power balance constraint. This approximation is carried out in two steps.…”
Section: Proposed Convexification Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Here, a linear approximation is presented which is based on the convex OPF approach recently reported in [29] for obtaining a convex equivalent formulation of the power balance constraint. This approximation is carried out in two steps.…”
Section: Proposed Convexification Methodsmentioning
confidence: 99%
“…where it is possible to obtain a linear equivalent if Taylor's series expansion is applied [29]. This approximation is presented in Equation ( 12), which assumes that the linearizing point is v 0 k,h .…”
Section: Linearization Of the Demand Nodesmentioning
confidence: 99%
“…where f i t i (t) represents the degree of maturity of the mass of agent i at time t, and worst(t) and best(t), respectively, indicate the suitability of the worst and the best factors of population in time, whose size can be calculated using Equations ( 10) and (11):…”
Section: Gravitational Search Algorithm (Gsa)mentioning
confidence: 99%
“…On the other hand, DG causes the power flow in distribution networks to change. Therefore, a main network with the presence of DG is not optimal for reducing losses; there needs to be a proper control in the network, so that the distribution network operates at optimal cost and with increased reliability [11]. In other words, with the advent of DG resources, several problems have appeared, such as maintaining and protecting resources [12], the way in which these resources are involved in setting the basic parameters of the network (such as frequency and voltage [13,14]), and the method for power exchange between the global network and distributed generation sources [15].…”
Section: Introductionmentioning
confidence: 99%