2018
DOI: 10.1109/tste.2017.2771954
|View full text |Cite
|
Sign up to set email alerts
|

Convex Optimization Based Distributed Optimal Gas-Power Flow Calculation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
58
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 138 publications
(58 citation statements)
references
References 35 publications
0
58
0
Order By: Relevance
“…References [5]- [7], [15]- [20] propose different piecewise linear approximation methods to solve the non-convex and nonlinear IEGS optimization problem. These methods mainly include the following types, metaheuristic algorithm [5], [6], second-order cone (SOC) relaxation [15], [16], and piecewise linear approximation [7], [17]- [20] etc. References [18], [21] present the study of the coordinated scheduling strategy, in which, the models of the electricity network and gas network are developed in detail, and the operation constraints of the networks are fully considered.…”
Section: Nwmentioning
confidence: 99%
“…References [5]- [7], [15]- [20] propose different piecewise linear approximation methods to solve the non-convex and nonlinear IEGS optimization problem. These methods mainly include the following types, metaheuristic algorithm [5], [6], second-order cone (SOC) relaxation [15], [16], and piecewise linear approximation [7], [17]- [20] etc. References [18], [21] present the study of the coordinated scheduling strategy, in which, the models of the electricity network and gas network are developed in detail, and the operation constraints of the networks are fully considered.…”
Section: Nwmentioning
confidence: 99%
“…x are the gas pressure and gas flow at the time of ij of pipe x, M 1 , M 2 are the pipe transfer constants. In reference [27], the Euler finite difference method is used to transform the partial differential equation 3, which is difficult to be solved directly into an algebraic equation. The pipe ij is divided into N segments, and the length of each segment x ij = l ij /N , the equation is expressed as follows:…”
Section: Natural Gas Network Modelmentioning
confidence: 99%
“…After the above transformation, formula (22) is convex constrained and (23) is still nonconvex. The convex relaxation of formula (23) is performed by using the sequential second-order cone programming method presented in the reference [27]. If the quadratic term is linearly expanded by the first order Taylor series, then expression (23) can be approximated as follows:…”
Section: A Pccp Algorithmmentioning
confidence: 99%
“…However, in reality, electricity and NG subsystems are generally owned by different utilities [16,17]. If the centralised optimisation method is used, a system operator is required to collect all the information of electricity and NG subsystems for centralised decision-making, which cannot guarantee the information privacy and decisionmaking independence of each subsystem [17][18][19]. Therefore, it is a favourable choice to make dispatch decisions in a decentralised manner.…”
Section: Introductionmentioning
confidence: 99%