Dynamic Microgrid-based Operations

A New Operational Paradigm for Distribution Networks

Joel Jose
joeljose@iitb.ac.in

Research Scholar
Indian Institute of Technology Bombay, India

ISGT-Asia 2016
30 November 2016

∗
This research is a joint collaboration between Indian Institute of Technology
Bombay and Tata Consultancy Services Limited (TCS)

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 1 / 17

Introduction

Modern Distribution Systems

Wider deployment of renewable generation and distributed energy
resources (DERs)
View demand side as a resource

Microgrids: Distribution networks containing loads and DERs

Grid connected and islanded modes of operation
Utilization of renewable energy, improved reliability, lower losses and
better voltage profiles in the distribution system

New Architectures:
Coupled Microgrids: higher reliability and modularity - building blocks
for Smart Distribution
More-Microgrids and Multi-Microgrids: EU’s More Microgrids Project
Co-operative Microgrids and Coalition Algorithms: maximize
transactions, minimize grid import, reduce power loss

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 2 / 17

Dynamic Microgrids

Microgrid boundaries dynamically configured every 5-15 minutes

Triggers: supply-demand conditions, topology changes, economics ...
Better prepared to handle potential disruptions
Grid connected during normal operation; islanded only when necessary
Supply-adequate microgrids which transition into islands if need be
Flexibility provided by controllable loads and storage devices

Bulk supply
Similar Ideas: Distribution Substation
connection
(sub-transmission)

Full Substation
Single
Microgrid PV
Wind Customer
Other Microgrid
Full Feeder
Feeders FC
Microgrid

Partial Feeder
Micro-grid
Feeder

PV

Source: Vadari and Stokes Utility 2.0 and The Dynamic

Microgrid, 2013
Source: Sandia Tech. Rep. SAND2008-0944 P, 2008

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 3 / 17

Dynamic Boundaries

30 32 33
C4 25 29
70 kW 24 C5
1 0 kW 31 18
28
C1 23 26 27 16
3
-10 kW
15 17
2
4 5 6 13
120 kW
9 C2 14
19 7 35 kW
8
C3 11 12
S/S 40 kW
20 10
Tie-line
Microgrid Boundary 21 22

Imbalances shown in each microgrid: (+) surplus; (-) deficit

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 4 / 17

Dynamic Boundaries

30 32 33
C4 25 29
70 kW 24 C5
1 -10 kW 31 18
28
C1 23 26 27 16
3
10 kW
15 17
2
4 5 6 13
130 kW
9 C2 14
19 7 35 kW
8
C3 11 12
S/S 40 kW
20 10
Tie-line
Microgrid Boundary 21 22

Changing supply-demand conditions ⇒ changing microgrid boundaries

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 5 / 17

Network Partitioning

Desirable features:
Supply adequacy, reactive power and other ancillary services
availability, minimal switching operations, geographical proximity of
loads and DERs within a microgrid
Flexibility for reconfiguration
Priority for critical loads

Algorithms:
Spectral partitioning
Community detection
Game theory
Optimization

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 6 / 17

Spectral Partitioning Algorithms

Distribution network represented as a weighted graph – magnitudes of

line power flows used as edge weights

Spectral bi-partitioning using Fiedler vectors: needs recursive

application for obtaining desired number of microgrids

Single step k-way partitioning is obtained using k eigenvectors

corresponding to k smallest eigenvalues of graph Laplacian

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 7 / 17

k-way Partitioning Algorithm

Uses the k eigenvectors corresponding to the k smallest eigenvalues

of the Laplacian matrix to obtain a partitioning matrix
A normalized partitioning matrix capturing the measure of proximity
between nodes (as cosine of angle between these vectors is formed
Choose k nodes as seeds and use the measures from the partition
matrix to classify the remaining n − k nodes into k partitions
Disadvantages: ignores the properties of nodes, number of microgrids have
to be pre-specified

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 8 / 17

Dynamic Microgrids for Service Restoration

Business as usual (BAU)

DGs disconnected during fault isolation and service restoration
Service restoration achieved using switching – alternative supply points

Dynamic microgrid-based operations (DMBO)

DGs aid in service restoration
Switching allows for islanding and re-synchronization

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 9 / 17

 63 63

Service restoration strategies using BAU and DMs

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 10 / 17

Minimal Customer Interruptions - 33 bus system

Faulted Scenario 1 Scenario 2

Section BAU DMBO BAU DMBO
7-8 3.715 1.01 3.715 0.89
9-15 3.715 0.00 3.715 0.00
26-27 3.715 1.01 3.715 0.92
29-30 3.715 0.80 3.715 0.92
S/S 3.715 0.00 3.715 0.00

Amount of load interrupted (MW)

during fault isolation and service restoration

*BAU service restoration option which causes minimum power losses has been
selected

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 11 / 17

Minimal Customer Interruptions - 70 bus system

Faulted Scenario 1 Scenario 2 Scenario 3

Section BAU Fixed DMBO BAU Fixed DMBO BAU Fixed DMBO
16-17 1.14 0.46 0.46 1.14 1.14 0.16 1.14 1.14 1.14
39-40 1.18 0.00 0.00 1.18 0.00 0.00 1.18 0.78 1.18
53-54 1.31 1.31 1.31 1.31 1.31 0.23 1.31 1.31 0.54
S/S-1 2.12 0.00 0.00 2.12 2.12 0.56 2.12 2.12 1.17
S/S-1 & 2 4.47 0.00 0.00 4.47 4.07 0.64 4.47 4.47 2.09

Amount of load interrupted (MW) during fault isolation and service restoration

Scenario 1: DGs running at full capacity

Scenario 2: Total DG output approx. 70% of Scenario 1
Scenario 3: Total DG output approx. 50% of Scenario 1

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 12 / 17

Improved Quality of Supply
1 2 3 4 400 kW
S/S PV farm

350 kW 90 kW 300 kW
170 kVAr 45 kVAr 145 kVAr

Modified IEEE 4-bus system used for dynamic studies

150 150

100 100

50 50

current (A)
current (A)

0 0

-50 -50

Phase A
-100 -100
Phase B
Phase C
-150 -150
150 200 250 300 350 400 450 500 550 1350 1400 1450 1500 1550 1600 1650 1700 1750
time (ms) time (ms)

BAU: fault at 0.2s BAU: DG reconnected at 1.42s

150 150

100 100

50 50

current (A)
current (A)

0 0

-50 -50

-100 -100

-150 -150
150 200 250 300 350 400 450 500 550 1350 1400 1450 1500 1550 1600 1650 1700 1750
time (ms) time (ms)

DMBO: fault at 0.2s DMBO: re-synchronization at 1.42s

Transients during islanding and re-synchronization of microgrids

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 13 / 17

Dynamic Microgrid Configurator

Distribution Network

SCADA

FL

DPF SOM
Dynamic
NTP Microgrid
Configurator
SE VVC

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 14 / 17

Technology Enablers

Realization of DMBO will require supporting technologies:

Distribution automation
Adaptive protection schemes
Modern communication systems
Smart switches
Feeder reconfiguration
Advanced controllers for power electronic converters
...

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 15 / 17

Concluding Remarks

This paper introduces the concept of dynamic microgrids and

provides a systematic way to think of the same
dynamic microgrids are defined, desirable features identified
algorithms to identify them are discussed
system architecture, operation and control with them is described
Results of preliminary investigations on quantifying the benefits of
DMBO are presented
More to be done:
Optimize the design of dynamic microgrid: better boundaries versus
faster implementation
Changes to grid codes
Development of suitable power electronic interfaces
Designing adaptive protection schemes
Designing the sequence of switching
What level to implement primary/secondary/tertiary distribution?

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 16 / 17

Thank You

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 17 / 17

References
R. H. Lasseter, “Smart distribution: Coupled microgrids,” Proceedings
of the IEEE, vol. 99, no. 6, pp. 1074–1082, June 2011.
L. Tao and C. Schwaegerl, “Advanced architectures and control
concepts for more microgrids,”
http://www.smartgrids.eu/node/14, Tech. Rep. SES6-019864,
Tech. Rep., 2009.
N. Hatziargyriou, Operation of Multi-Microgrids. Wiley-IEEE Press,
2014, pp. 344–.
M. Vadari and G. Stokes, “Utility 2.0 and the dynamic microgrid,”
Fortnightly Magazine, November 2013. [Online]. Available:
http://www.fortnightly.com/fortnightly/2013/11/
utility-20-and-dynamic-microgrid
P. K. Chan, M. D. F. Schlag, and J. Y. Zien, “Spectral k-way
ratio-cut partitioning and clustering,” IEEE Transactions on
Computer-Aided Design of Integrated Circuits and Systems, vol. 13,
Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 1/4
System Data

Power Output (kW)

Bus No. Type
Scenario 1 Scenario 2
6 Small Hydro 600 500
9 Small Hydro 400 400
15 PV 250 250
16 Small Hydro 400 400
20 Wind 150 150
21 Wind 250 250
24 Wind 400 400
25 PV 600 600
31 PV 400 450
32 PV 400 460

Table : DG data for 33-bus example

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 2/4

System Data

Power Output (kW)

Bus No. Type
Scenario 1 Scenario 2 Scenario 3
14 PV 500 300 200
26 Small Hydro 550 350 350
27 PV 200 200 200
28 PV 200 150 100
33 PV 350 150 0
39 Wind 500 220 300
44 Wind 400 400 200
50 Small Hydro 400 300 100
59 Wind 600 600 600
61 PV 200 150 0
64 Small Hydro 400 250 100
67 PV 300 300 300
68 PV 200 100 0

Table : DG data for 70-bus example

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 3/4

k-way Partitioning Algorithm

Algorithm k-way partitioning for configuring DMs

1: Compute the Laplacian matrix Q of the weighted graph
2: Find the k smallest eigenvalues and the corresponding eigenvectors
x1 , x2 , . . . , xk of Q
3: Construct matrices X = [x1 , . . . , xk ], N = diag {ni }, where ni =
qP
k 2 T
1/ h=1 xih and P = NXX N; P is the partition matrix, with each
element pij representing a measure of proximity between nodes i and j
4: Select k nodes which are sufficiently separated from each other (using
pij values) to act as centres/seeds of k partitions and store them into a
vector S = {S1 , . . . , Sk }
5: Use the measures from P to determine the proximity of a node to each
seed in S and classify the remaining n − k nodes into k partitions by
choosing the seed closest to each node

Joel Jose Dynamic Microgrid-based Operations ISGT-Asia 2016 4/4