An Improved Spatial Branch-and-Bound Algorithm for Non-Convex Optimal Electricity-Gas Flow

Addressing non-convexity plays a fundamental role in solving the optimal electricity-gas flow models. In this paper, an improved spatial branch-and-bound algorithm is proposed to solve the non-convex problem, which is formulated as a mixed-integer bilinear programming, for its exact solution. The co...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on power systems Ročník 37; číslo 2; s. 1326 - 1339
Hlavní autori:	Liu, Pengxiang, Wu, Zhi, Gu, Wei, Lu, Yuping
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Approximation algorithms branching strategy Compressors Computational geometry Continuity (mathematics) Convexity Electricity Exact solutions Gas flow Manganese Mathematical model Mixed integer mixed-integer bilinear programming non-convex optimization Optimal electricity-gas flow Optimization Pipelines Programming spatial branch-and-bound
ISSN:	0885-8950, 1558-0679
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!