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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on power systems Vol. 37; no. 2; pp. 1326 - 1339
Main Authors:	Liu, Pengxiang, Wu, Zhi, Gu, Wei, Lu, Yuping
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!