<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T22:37:40Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/18332" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/18332</identifier><datestamp>2025-03-26T23:35:43Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">El-Shatshat, Ramadan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="e45d64f1-0e71-4f37-bb3e-9f46d097d0ff" confidence="600">OTHMAN MOHAMED, Ayman M.</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-05-26T17:09:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-05-26T04:50:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-05-26</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2020-05-17</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/18332</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">For over half a century, Power Flow (PF) and its optimized version, Optimal Power Flow&#xd;
(OPF), has become one of the most important and widely used tools in power system&#xd;
planning, operational planning, and operation/control. The solution to the PF problem&#xd;
is carried out extensively for various power system activities and is essential for both offline&#xd;
applications, such as planning and stability studies and online applications, including&#xd;
security monitoring and contingency analysis, optimal power flow, to name a few. In comparison,&#xd;
OPF seeks to optimize the operation and planning of electric power generation,&#xd;
transmission, and distribution networks subject to various system constraints and control&#xd;
limits. Different PF/OPF techniques have been proposed, each with its own unique&#xd;
formulation, solution methodology, advantages, and drawbacks. Motivated by the growing&#xd;
inclusion of distributed energy resources, such as highly variable renewable generating&#xd;
resources; and further, by the speed and convergence limitations of existing tools, this&#xd;
research focuses on developing simple, accurate, fast; yet, computationally efficient tools&#xd;
for operation and planning of electric power systems. This thesis introduces a radically&#xd;
new generalized direction in power system problem formulations and proposes a novel&#xd;
Graph Theory-based optimization algorithm for solving the PF/OPF problem, that is also&#xd;
suitable for transmission, distribution, and hybrid AC/DC power systems.&#xd;
&#xd;
To start, a novel algorithm is developed for a power flow solution based on maximumflow&#xd;
formulation, titled “Flow-Augmentation PF.” Modeling of power system components&#xd;
for the proposed network-flow formulation is presented, followed by s-t flow modeling. The&#xd;
proposed method formulates a power flow problem as a network-flow problem and solves&#xd;
it by using a maximum-flow algorithm, inspired by the push-relabel max-flow technique.&#xd;
In contrast to previously established methods in the literature, the proposed methodology&#xd;
relies on transforming the power system configuration and topology into an efficient analytical&#xd;
form (matrices and arrays). The solution methodology of the proposed PF algorithm&#xd;
is discussed in detail. The methodology includes a discussion on the algorithm correctness,&#xd;
termination, and computational complexity. The developed Flow-Augmentation method&#xd;
solves the power flow problem using matrix-vector multiplication in its most abstract form, and further, the developed method is independent of system parameters and network configuration.&#xd;
The proposed algorithm captures the full system model and handles any system&#xd;
configuration without resorting to special treatment. The presented algorithm is computationally&#xd;
efficient and compares favorably with current methods, in terms of execution time&#xd;
and accuracy.&#xd;
&#xd;
Second, a new generalized PF/OPF framework based on the minimum-cost flow network&#xd;
model is introduced. The proposed formulation seeks to find the network-flow distribution&#xd;
that optimizes a stated objective function, such as generator costs or gas emissions,&#xd;
system losses, or any other indices. The solution of the PF problem is obtained by using&#xd;
a proposed modified version of the minimum-cost flow model, termed MinLoss-Flow&#xd;
PF algorithm. This algorithm builds upon the models developed in the above-mentioned&#xd;
maximum-flow-based method, in terms of system component modeling and graph formulation.&#xd;
The developed MinLoss-Flow PF focuses on finding the minimum system losses&#xd;
that satisfy both the technical and engineering constraints. As such, the generalized mathematical&#xd;
formulation, based on cost flow calculation and its properties, is developed. The&#xd;
MinLoss-Flow PF method is fully discussed and validated against well-known methods&#xd;
used for transmission and distribution systems.&#xd;
&#xd;
Third, this thesis presents a sequential network-flow graph-based method for a steadystate&#xd;
power flow solution in hybrid AC/DC multi-terminal power systems. The proposed&#xd;
method is a unique and novel one, which differs from other established methods that involve&#xd;
the use of modified versions of classical power flow methods. The proposed method&#xd;
formulates the hybrid AC/DC power flow problem as a maximum network-flow problem&#xd;
and solves it, using a max-flow-based algorithm. The proposed flow-augmentation power&#xd;
flow algorithm solves the AC and DC sides sequentially while employing the detailed converter&#xd;
model, including the converter transformer, filter, and the converter loss parameters&#xd;
for converter power loss calculations. The proposed method is validated using standard&#xd;
hybrid 5-bus and CIGR´E-B4-DC systems.&#xd;
&#xd;
The performance of the novel graph-based PF/OPF tools is validated using several&#xd;
benchmark networks of different sizes, topologies, and parameters. Many case studies&#xd;
v&#xd;
were conducted and compared with the most commonly used techniques for transmission,&#xd;
distribution, and hybrid AC/DC systems. The proposed algorithm is also validated and&#xd;
compared with the results obtained from two commercial software packages, PSS/E and&#xd;
PSCAD. The proposed formulation is computationally efficient, as it is based on matrixvector&#xd;
multiplication, and is also scalable, considering the formulation works as a graphbased&#xd;
method, which, inherently, allows for parallel computation for added computational&#xd;
speed. This proves to be a strong advantage for the proposed method, as a significant&#xd;
reduction in computational time is observed, as a result. Test results show significant&#xd;
computational gains of about 70% when compared with the Newton-Raphson on the IEEE&#xd;
118-bus system, and a value less than 50% reduction compared with the Newton-Raphson&#xd;
method applied to hybrid AC/DC system. The results also show that the proposed algorithm&#xd;
takes less than 1.4% of the execution time required by the Backward-Forward-Sweep&#xd;
method on the 69-bus. The developed graph-based PF/OPF algorithms are coded in GNU&#xd;
OCTAVE environment and the simulation results are presented to validate the effectiveness&#xd;
of the proposed techniques.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">power flow</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">network flow</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">hybrid AC/DC power flow</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Graph-Based Power Flow Solution Methods for Electric Power Systems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">2 years</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">El-Shatshat, Ramadan</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Engineering</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>