2017
DOI: 10.1109/access.2017.2761391
|View full text |Cite
|
Sign up to set email alerts
|

Energy Management for Distribution Networks Through Capacity Constrained State Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(7 citation statements)
references
References 22 publications
0
7
0
Order By: Relevance
“…The inequality constraints of v(y), consists of non-linear and non-convex functions, can be transformed into inequality constraints on z using a linearisation process. In this paper, Jacobian matrix-based analytical method [35] is considered. The Jacobian matrices of input and output vector functions are:…”
Section: A Local Voltage Management (Lvm)mentioning
confidence: 99%
“…The inequality constraints of v(y), consists of non-linear and non-convex functions, can be transformed into inequality constraints on z using a linearisation process. In this paper, Jacobian matrix-based analytical method [35] is considered. The Jacobian matrices of input and output vector functions are:…”
Section: A Local Voltage Management (Lvm)mentioning
confidence: 99%
“…Active power curtailment amount of PV units at node j Q G,j Reactive power generated by PV units at node j Q C,j Reactive power generated by RPC With the increasing penetration of distributed photovoltaics (PVs), distribution networks (DNs) are gradually transforming from passive networks with unidirectional power flow to active distribution networks (ADNs) with bidirectional power flow [1]. The reverse power flow and voltage violation caused by excess PV power have brought significant challenges to the operational stability of DNs, and thus the optimization approach for ADNs to deal with these problems has become a hot topic of research in recent years [2]- [4]. The voltage optimization of ADNs is typically formulated as a mixed-integer non-linear optimization problem (MINOP) as it includes both continuous and discrete decision variables, e.g.…”
Section: Variables P Decjmentioning
confidence: 99%
“…According to the condition g 1−3 ≤ −1 and g 1−3 ≥ 0, RP is decomposed into subproblems RP1 and RP2, and their lower bound f 0 is set as 11.4639. 2) Solving the problem RP1 and get the solution ofg 2 = {−1, −0.1183} and f 2 = 54.4851. Solving the problem RP2 and get the solution ofg 3 = {0, 0.3027} and f 3 = 11.4691.…”
Section: Case Studies and Analysis A 32-bus Practical Casementioning
confidence: 99%
“…Classical optimization algorithms such as linear programming (LP) are widely used for solving OPF problems [98]. In [99], the capacity constraint was used to form linear inequality constraint for the objective function in OPF. Heuristic methods have been investigated for these problems, such as particle swarm optimization [100], ANN and GA [101].…”
Section: Constraint Managementmentioning
confidence: 99%