2016 5th International Conference on Informatics, Electronics and Vision (ICIEV) 176

An Ant Colony Optimization Algorithm for Load

Shedding Minimization in Smart Grids
Muztaba Hasanat, Mehadi Hasan, Istiak Ahmed, Mehedi Iqbal Chowdhury, Jannatul Ferdous and Swakkhar Shatabda
Department of Computer Science and Engineering, United International University
House 80, Road 8A, Dhanmondi, Dhaka-1209, Bangladesh
Email: swakkhar@cse.uiu.ac.bd

Abstract—In this paper, we present an ant colony optimization
algorithm for load shedding minimization in smart grids. Smart
grid technologies offer efficient solutions to the supply and
distribution of power. However, its a great challenge to maintain
the proper flow in the grid and minimize the load shedding. In
reality, the situation might change dynamically and the behavior
of the grid network is also stochastic. We applied our algorithm to
solve the load shedding minimization problem in a deterministic
setting. Our algorithm is a hybrid ant colony optimization with
a constructive ant-based method followed by a local search
phase. We have tested the performance of our algorithm on
datasets generated using statistical data. Moreover our algorithm
shows potentials for exploration in terms of the runtime and the
significantly better solutions have been found.
Keywords-power grid, local search, tabu-list, optimization.
I. I NTRODUCTION
Power transmission is one of the most important issues in
smart grid networks. Even with higher production of energy,
the failure to ensure the flow in the correct transmission lines
might occur in power shortage and load shedding. Minimizing
load shedding is an important logistics problem [1]. Mini-
mizing load shedding ensures efficient supply of power in
every point of grid network. Power flow optimization is done
by either using optimizing source side management (SSM)
or Demand side management (DSM). DSM is a an option
where demand is being optimized by the modification of
consumer demand for energy through various methods like
power shifting [2], peak load reduction [3] and consumer
demand shifting for using appliances [4]. In case of SSM,
least number of sources can be used to supply more demand
so that some of the power can be saved for future purpose. The
demand is selected according to most desired one, means the
source will be supplying those demands which have highest
need for power [5]. The source will keep few residues within
themselves, the sources will be not being kept null. While
transmission, there is always loss and these increases with
distance and overload, an optimized path need to be chosen
that all the demand get the required power and less loss.
Even after transmission, there is enough power so that it can
supply if more power is needed during any necessity. Various
algorithms are being used to solve power flow optimization
problem [6], [5].
In this paper, we present a novel ant colony optimization
(ACO) algorithm [7]. ACO simulate the behavior of ant
colonies how they quest food from nest to food source.Our
algorithm uses artificial ants to navigate through the network
and satisfy the demands at various nodes or demand sites.
Successive local search phases optimize based on the ant
based constructions. In each epoch, the successor ants follow
the pheromone trail left by the ants in the earlier epochs.
The experiments are being performed on artificially generated
datasets and the effectiveness of various components of this
algorithm is tested. The main contribution of this paper are as
follows:
• A deterministic model for load shedding minimization in
power grids.
• Application of ant colony optimization to solve this hard
combinatorial optimization problem.
• A novel perturbation local search procedure to improve
over the solutions found by the constructive search.
The rest of the paper is designed as follows: Section II
presents our deterministic model for load shedding minimiza-
tion problem and the necessary background; Section III de-
scribes some related work in the literature; Section V describes
the algorithm being used; Section VI discusses and analyzes
the experimental results; and finally, Section VII presents our
conclusions and outlines our future work.
II. P RELIMINARIES
Smart grid means the application of digital processing and
communication to the power grid, making data flow and
information management central to the smart grid. At present,
the modern world’s demand form electricity is rapidly increas-
ing due to industrialization. An electric grid is not a single
entity but aggregate of multiple network and multiple power
generation. In smart grid system, electricity distributed among
the electric grids based on demand. Smart grid optimization is
an efficient technology to distribute power among the electric
grids. We use Ant Colony Optimization to get good quality
solution within a very short time.
A key constrain of electric power is that, with minor excep-
tions, electrical energy cannot be stored, and therefore must be
generated as needed. A sophisticated control system is required
to ensure electric generation very closely matches the demand.
If the demand for power exceeds the supply, generation plant
and transmission equipment can shut down, which in the worst
case may lead to a major regional blackout. Transmitting

978-1-5090-1269-5/16/$31.00 ©2016 IEEE


Fig. 1. Connections between different source and demand sites.
electricity at high voltage reduces the fraction of energy lost to
resistance, which varies depending on the specific conductors,
the current flowing, and the length of the transmission line.
Electricity is transmitted at high voltages (120 kV or above)
to reduce the energy losses in long-distance transmission. So
for generation of high electricity, we need powerful cables
so it increases the transmission cost.The transmission flow is
heterogeneous as it needs to consider the cost, power loss,
need to supply the nearby demand as well the demand which
has more consumption. Provided, all the demand should be
connected to the source so that there is no black out for
any consumer. In Bangladesh, two season changes are being
focused like summer and winter.In summer, consumption is
high where as in winter its less. So the remaining power
which is not being used during winter, will be used when
the consumption level is high during summer.
A. A Deterministic Model
In this model, there are two types of nodes: demand and
supply. The supply nodes may represent the power generating
sites and the demand nodes are residential locality or industrial
area. These nodes are connected to each other by power lines
with varying capacity depending on the connection types.
Supply of a node i is indicated as si and demand is indicated
as di . However these quantities are in the same units and
only varies in the sign. The grid is given a weighted graph,
G ≡ hV, Ei. Each edge, (i, j) ∈ E indicates links between two
nodes, i ∈ V, j ∈ V . The set of vertices V = S ∪ D, where S
is the set of supply nodes and D is the set of demand nodes.
The flow capacity of each of the edges are given as a matrix
C. Each element, cij ∈ C denotes the flow capacity of the
link between node i and j.
1) Variables: A set of flow variables in matrix X where
each individual flow from node i to j is indicated as xij . This
variable is used to identify the power flow of the model. The
flow is unidirectional. A flow in a particular direction means
a negative flow in the reverse direction.
2) Constraints: Flow in each link must not exceed the
associated capacity of the links.
|xij | ≤ cij
The power flow within the transmission lines is less than or
equal to the capacity of transmission lines so that there is no
eddy current loss within the lines.
X healing and preventive methods [6]. Self healing is done
xij ≤ si , ∀i ∈ S
177
where si is the supply at site i. However, for the demand
sites the total demand might not be fulfilled. However, the
total amount must not violate the flow balance, which could
be denoted by the following constraint:
X
xij ≤ 0, ∀i ∈ D
Now, there is a load shedding li associated with each
demand site negative in sign defined as following:
X
li = di + xij ≤ 0, ∀i ∈ D
Our main objective is to meet the demand, due to shortage of
source capacity or leakage in transmission lines the demand
is greater than transmitted power.
3) Objective: The objective function is to minimize the
total load shedding in the grid defined by the following
equation: X
L= li , ∀i ∈ D (1)
B. Ant Colony Optimization(ACO)
Ant colony optimization is a stochastic optimization ap-
proach inspired from ants in nature. In real life, ants are
searching food and returning to their nest in a shortest path by
using pheromone trail. The ACO algorithm creates artificial
ants and pheromone to search for good quality path from
graphs. Pheromone is an evaporative element and thus the
paths with more pheromone content the more explored by the
successive ants. The first phase of the ACO algorithm is a
constructive algorithm that builds an initial solution from a
finite set of solution components. Like any other constructive
algorithms it starts from an initial empty partial solution,
S = φ, and at each step the computational ant selects one
of the solutions components and expands the partial solution.
The ant performs a walk on the construction graph, where
each vertex in the graph corresponds to a solution component.
A state is denoted by the partial solution constructed by the
ant. Each ant k at state x computes a set Ak (x) of feasible
expansions possible from its current state x. For the ant k,
the probability pkxy of moving from state x to state y depends
on the pheromone level τxy . The probability is defined as the
following:
α β
τxy ηxy
pkxy = P (2)
α β
z∈Ak (x) τxz ηxz
Pheromones are also updated in each iteration in two ways:
uniform evaporation followed by deposit of pheromone by the
ant that found the best solution.
III. R ELATED W ORK
Different optimization techniques have been proposed to
solve the smart grid related problem [8]. During load cuts
communication [9] and self heal is necessary so that there
is no black out. Demand side management and optimal load
shedding with minimum load cuts are proposed using self
through demand side where optimal power flow determined

through load shedding scheme by Bacterial particle swarm
optimization [10]. Demand side management along with flow
control and cost management is being analyzed previously
with combination of Fuzzy Logic and Genetic Algorithm [11].
To balance the power flow from supplier to consumer, the
mechanism of power shiftable and time shiftable appliances is
being used [4]. Load management is done using Integer Linear
Programming where hourly peak load is being reduced [4]. In
this case, the customers can take decisions regarding energy
consumption, reduce peak load demand and reshape profile.
Heuristic based evolutionary algorithm is used for solving
minimization problem dividing into three sectors: residential,
commercial and industrial area [5]. Evolutionary algorithm
allows implementation of features that model load demand
pattern based on customer needs [5]. Some devices have high
priorities that are taken consideration by using evolutionary
algorithm where load shifting according to time steps are used.
Integer linear programming (ILP) models designed to identify
optimal combinations of supply sources, demand sites for them
to serve, and the pathways along which the reallocated power
should flow [1]. Stochastic search algorithms are applied to
solve a related problem finding optimal power flow, minimiz-
ing load shedding and cost management [5].
For data collection in real time from remote locations,
SCADA (supervisory control and data acquisition) is a cat-
egory of software application program for process control in
order to control equipment and conditions [12], [13].
IV. W HY C HOSE A NT C OLONY O PTIMIZATION
It has been proofed that ACO algorithm better perform
in hard combinatorial problem like in TSP and VRP. And
even the hard combinatorial problem where constraints are
too many like VRPTW this algorithm shows very good result
in a very good time limit. So, minimizing load shedding
in a graph with many constraints is similar kind of hard
combinatorial problem as mentioned earlier. We tried our
problem to solve with Monte Carlo and Gibbs algorithm.
Where this algorithm won’t work relatively large graph(grater
than 20 nodes). Whereas, ACO algorithm works in a large
graph smoothly and converge a suboptimal result in a very
good time. And combination with local search this algorithm
shows much better result. Therefore to solve a very large graph
we use ACO algorithm.
V. O UR A PPROACH
In this section, we present our ant colony optimization
(ACO) for solving smart grid optimization problem.
A. Tour Construction
In our method, an artificial ant starts from a supply node
with the electricity or power that the node generated. It will
traverse the graph and give the electricity to the demand node
until the electricity or power that the ant carried runs out or
there is no way to move another node. This same ant placed in
every supply node and distribute the electricity to the demand
node. Note that if the ant reach in a supply node then the ant do
178
nothing and simply select the next node. Ant has to carry the
power less than or equals to the link capacity between current
node to next selected node. So the rest of the power that is
not carried by the ant is left in the current node. That is the
residual in that current node. This same ant will place those
nodes which has residual. If there are 10 ants then that 10
ants will distribute the electricity to the graph in 10 different
ways. Note that the every ant will place to the source vertex
every time randomly, so that it will ensure that there will be
no predetermined sequence. After getting the result from those
10 ants separately we calculate which ant has the graph that
has minimum quality. In our method quality is total residual
and load shedding in the graph. Then the pheromone trail will
be updated according to the path that the ant has made.
The artificial ant will start exploring nodes from sources.
It will choose a link randomly to visit neighbour node. Ant
will choose a link based on probability of load shedding and
pheromone. Load shedding will be a heuristic value controlled
by β. Pheromone will be controlled by α. An ant will use a
link only once. Artificial ant will carry electricity based on
link capacity. First it will count all the unused links of the
selected next node. We assume that half of unused link will
be incoming link rest of them are outgoing link .After that
it will calculate the average of selected next nodes demand
by incoming links. Then the selected outgoing link will carry
flow between minimum of chosen link capacity, the assume
average flow of the next node, and the ant’s current power. So
that the minimum value from those will be the ant’s power
that the ant will carry to the next selected node. Rest of the
power of that ant add to the current node’s residual. Artificial
ant will save the path in its memory. It will try to explore as
much node as possible using total sources power. If there is
any residue in any node ant will try to distribute that power
too.
Probability of choosing next node is given in Equation 2.
Pheromone evaporation: After all the ants complete mak-
ing their solution, the pheromone trail are updated based on
the quality. Before update pheromone trail first lowering the
pheromone value in all link by a constant factor. This is called
pheromone evaporation. This method helps to avoid to take
bad decision that has previously been taken. Ant will think
that it is a bad link to travel. Equation [7] of pheromone
evaporation is given in the following:
τxy = (1 − )τxy (3)
Pheromone Update: When all ants make their solution,
then those solutions are compared with their quality. This
happens after the pheromone evaporation is done. The quality
of a solution is total load shedding and residual. Which ant
make the graph minimum quality that we are considering the
ant that make good solution. Then the ant that has good quality
will update pheromone trail using its corresponding traveling
path. The following equation defines the amount of pheromone
deposit in a particular step or edge taken by the ant.

τxy = ρ ∗ τxy ∀xy ∈ Sb (4)
Here, Sb is the local best solution and ρ is a constant.
Reset Pheromone Trail: After many iteration ants are
producing the same result. So in the ACO algorithm there
is a threshold value ψ. If ants are producing same result and
it over the threshold value then simply reset the value.
The experimental result shows the optimal setting of the
different parameters of the algorithm as shown in the following
table:
TABLE I
PARAMETER SETTING FOR THE TOUR CONSTRUCTION .
α β  ρ ψ
3 2 0.75 2 20
B. Local search:
We use local search to improve the given sub-solution graph
which was constructed by our ant colony algorithm. In most of
the cases, we observed that the nodes in the graphs contains
residuals. In particular, the nodes might have some residue
power which is not distributed in the optimal way due to some
earlier decision made by the ant. The goal of our local search
is to minimize the residual of our graph. We use this method
because residue occurs when ant give more supply to a node.
If we move that residue to other nodes it will not decrease the
quality of graph.
First it will pick a node randomly. If that node has residue
then it will pick a link among the outgoing links which is not
full of its capacity. After that local search will update the link
capacity by choosing the minimum value between the residue
and rest of the capacity of the link. Therefore the connected
node with that link has gain the electricity from the selected
node and that node add the that amount of electricity to its
demand. So that the load shedding of that node will reduce.
C. Search Procedure
Our search algorithm is depicted in Algorithm 1. It starts
with a constructive ACO algorithm followed by a local search
procedure.
VI. E XPERIMENTAL R ESULTS
We have implemented the algorithms in Java 8 and have run
our experiments on an AMD Phenom II X6 1100T 3.3GHz
Processor with 6 GB DDR3 ram and 3.8 GB swap memory
running Ubuntu 14.04 LTS 64-bit operating system.
A. Datasets
The benchmark datasets are being generated a program
written in Java. We varied the size of the graph by changing
the number of nodes. The demand and supply data was
approximated using the data from the national grid data of
Bangladesh. We collected information provided in the PDB
website. For any given size of the graphs, the mean and the
179
Algorithm 1: ACO(maxIterations, maxAnts)
1 iteration = 0
2 initializePheromoneValues()
3 for antIndex = 1 → maxAnts do
4 initializeAnt(i)
5 while iteration + + ≤ maxIterations do
6 for antIndex = 1 → maxAnts do
7 Queue, Q = φ
8 foreach source ∈ G do
9 Q.add(source)
10 while Q.notEmpty() do
11 currentN ode = Q.pop()
12 setupAnt(currentN ode)
13 moveAnt()
14 performLocalSearch()
15 updateGlobalBest()
16 updatePheromoneTrail()
17 if stagnation then
18 resetPheromone()
19 return globalBest
variance of the supply were estimated. Sparse graphs were
generated assuming the average line voltages as capacities.
1) Graph Generator: It is said that we have written a
program to generate datasets to test the program called graph
generator. This graph generator works as follows. It takes
four parameters. Those parameters are respectively how many
node the graph will contain, what will be the total amount of
electricity that source nodes will generate in that graph, what
will be the total amount of demand that graph will contain
and what will be the percentage of supply node of total node
in the graph. Then the program calculate mean and standard
deviation based on the total electricity generation and total
demand of that graph. After that it will set generation of power
and demand of a node to all supply nodes and demand node.
After this generator connect those nodes with edges ran-
domly. It also set capacity of those edges according previously
taken procedure that generate the supply or demand of a node.
This is ensured that there is no duplicate edge between to node
and also there is no disconnected node.
B. Results
We compared our algorithm with other variants of the
algorithm: ACO only (without local search) and Local Search
only (without ACO). We performed experiments by running
different algorithms on each of the benchmark datasets. We
executed each of the algorithms for 5 times and reported best
and average load shedding values achieved in Table II. The
best values in Table II are shown in bold faced fonts.
C. Analysis
From the results reported in Table II, it is evident that
ACO algorithm works better than any other variants for all
the graph instances. The local search or the ACO constructive
 180

TABLE II
C OMPARISON OF LOAD SHEDDING VALUES ACHIEVED BY DIFFERENT
ALGORITHMS FOR VARIOUS DATASETS WITH DIFFERENT.

graph ACO only ACO+Local Search Local Search Only

size best avg best avg best avg
20 2125.78 2127.23 347.56 630.45 803.19 1287.25
30 1837.12 1990.76 587.26 723.89 987.21 1057.56
40 2359.77 2579.63 1178.13 1192.33 1789.43 1963.55
50 1637.26 1781.48 430.89 460.36 493.26 1280.59 (a) Initial Graph
60 1130.19 1159.17 305.73 347.29 597.39 701.87

procedure alone can not improve much while the combination

of both works much better. All these algorithms are run with
1000 iterations and with 20 ants. Maximum time required
by the algorithm was 17 seconds for the large graph which
is an indication that our algorithm can produce good quality
solutions within a very short period of time.
In first two figures it has been shown that how the algorithm (b) Saturated Graph(ACO + Local Search)
works. Figure one is the initial graph that is given with only
supply, demand and link capacity. Figure two shows the result
of given graph after performing the algorithm(ACO + Local
Search). The ant colony algorithm have run with 5 ants and
100 iteration and the local search perform with 50 iteration.
Algorithm run time under half of a second.
In the hybrid variant where both of the flavors are present is
capable of producing solutions with much lower values of load
shedding. As depicted in Figure 2, the local search is capable
of lowering the initial value of ant construction but could not
progress much. However, similar is the situation with the ACO
(c) ACO + Local Search
only variant.

VII. C ONCLUSION

In this paper, we presented an ant colony optimization

selection algorithm with a constructive ant procedure followed
by perturbative local search for load shedding minimization
problem. Our algorithm performs pheromone reset to handle
after stagnation. Our ACO algorithm produces significantly
better results with increase of number of nodes compared
to other algorithms. In future, we would like to solve the
problem with larger graph sizes and deploy the algorithm to (d) ACO only
solve for real data sets. We would like to extend our model
to incorporate the stochastic behavior of the power grid and
load. We would also like to develop a real time application
where user can input a graph that represent a electric grid will
be solve.

R EFERENCES

[1] K. E. Nygard, S. B. Ghosn, M. M. Chowdhury, D. Loegering, R. McCul-

loch, and P. Ranganathan, “Optimization models for energy reallocation
in a smart grid,” in Computer communications workshops (INFOCOM
WKSHPS), 2011 IEEE conference on, 2011, pp. 186–190. (e) Local Search Only
Fig. 2. Search progress for a typical run of the algorithms.
 181

[2] A.-H. Mohsenian-Rad, V. W. Wong, J. Jatskevich, R. Schober, and

A. Leon-Garcia, “Autonomous demand-side management based on
game-theoretic energy consumption scheduling for the future smart
grid,” Smart Grid, IEEE Transactions on, vol. 1, no. 3, pp. 320–331,
2010.
[3] G. Strbac, “Demand side management: Benefits and challenges,” Energy
policy, vol. 36, no. 12, pp. 4419–4426, 2008.
[4] Z. Zhu, J. Tang, S. Lambotharan, W. H. Chin, and Z. Fan, “An
integer linear programming based optimization for home demand-side
management in smart grid,” in Innovative Smart Grid Technologies
(ISGT), 2012 IEEE PES. IEEE, 2012, pp. 1–5.
[5] T. Logenthiran, D. Srinivasan, and T. Z. Shun, “Demand side man-
agement in smart grid using heuristic optimization,” Smart Grid, IEEE
Transactions on, vol. 3, no. 3, pp. 1244–1252, 2012.
[6] M. Hosseini-Bioki, M. Rashidinejad, and A. Abdollahi, “An implemen-
tation of particle swarm optimization to evaluate optimal under-voltage
load shedding in competitive electricity markets,” Journal of Power
Sources, vol. 242, pp. 122–131, 2013.
[7] M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by
a colony of cooperating agents,” Systems, Man, and Cybernetics, Part
B: Cybernetics, IEEE Transactions on, vol. 26, no. 1, pp. 29–41, 1996.
[8] S.-y. Chen, S. Song, L. Li, and J. Shen, “Survey on smart grid
technology,” Power System Technology, vol. 33, no. 8, pp. 1–7, 2009.
[9] H. Li and W. Zhang, “Qos routing in smart grid,” in Global Telecommu-
nications Conference (GLOBECOM 2010), 2010 IEEE. IEEE, 2010,
pp. 1–6.
[10] L. R. Ferreira, L. C. Siebert, A. R. Aoki, and T. S. Fernandes, “Load
shedding through optimal power flow to support self-healing actions in
distribution feeders,” in Transmission & Distribution Conference and
Exposition-Latin America (PES T&D-LA), 2014 IEEE PES. IEEE,
2014, pp. 1–6.
[11] E. De Santis, A. Rizzi, A. Sadeghiany, and F. M. F. Mascioli, “Genetic
optimization of a fuzzy control system for energy flow management
in micro-grids,” in IFSA World Congress and NAFIPS Annual Meeting
(IFSA/NAFIPS), 2013 Joint. IEEE, 2013, pp. 418–423.
[12] E. D. Knapp and J. T. Langill, Industrial Network Security: Securing
critical infrastructure networks for smart grid, SCADA, and other
Industrial Control Systems. Syngress, 2014.
[13] A. Daneels and W. Salter, “What is scada?” 1999.
[14] A. Bobbio, G. Bonanni, E. Ciancamerla, R. Clemente, A. Iacomini,
M. Minichino, A. Scarlatti, R. Terruggia, and E. Zendri, “Unavailability
of critical scada communication links interconnecting a power grid and a
telco network,” Reliability Engineering & System Safety, vol. 95, no. 12,
pp. 1345–1357, 2010.
[15] F. Glover, “Tabu search-part i,” ORSA Journal on computing, vol. 1,
no. 3, pp. 190–206, 1989.
[16] M. A. Rashid, S. Shatabda, M. Newton, M. T. Hoque, D. N. Pham, and
A. Sattar, “Random-walk: a stagnation recovery technique for simplified
protein structure prediction,” in Proceedings of the ACM Conference on
Bioinformatics, Computational Biology and Biomedicine. ACM, 2012,
pp. 620–622.