Of Mathematical Methods For Energy Management Optimization in Smart Grids
Of Mathematical Methods For Energy Management Optimization in Smart Grids
Of Mathematical Methods For Energy Management Optimization in Smart Grids
Abstract—Electricity demand increases every year and there is a Analytic optimization methods include : gradient-based
need to improve the existing power grid. Smart Grid concept was optimization algorithm, quadratic programming, interior point
developed by Institutes and researchagencies to address this need. method and nonlinear programming.
This new concept can be generally considered as an intelligent
power grid system that implements distributed energy. Gathering, This paper aims to answer to the question, why opt to use
coordinating operation and control of multiple distributed energy Genetic algorithm than other methods. To do this we group
resources, energy storages, loads and set of users pose a great various fitness based on genetic algorithm used in
challenge. Effective managementof smart gridwill have a benefit theliterature, compares parameters of these function, discuss
of reduced cost of energy, reducedstress on the electric energy and summarize equality and inequality constraints
infrastructure, and improved energy efficiency. This paper
reviews the research and studies on mathematical models used to This paper is structured as follows. In Section II, we present
optimize energy management in smart grid. The paper compares an overview about complexity classes and NP-hard problem
and discussesvarious fitness functions used in the literature. mean? In Section III, we review the Genetic Algorithm. We
Genetic Algorithm is explored and brief overviews of other
then give a brief overview to the other management methods
methods arediscussed.
used in Microgrid in Sections IV, .in Sections IV we conclude
Keywords-component; Genetic Algorithm;Microgrid; Optimal this paper and present some perspective.
Reactive Power Dispatch (ORPD)
II. COMPLEXITY AND NP-HARD PROBLEM?
I. INTRODUCTION A. Complexity classes
A key power generation paradigm enabled by Smart Grid In practice, heuristic techniques use the enumeration of all
(SG) isthe distributed generation (DG). DG takes advantage of possible solutionsto find the optimum solution. As the set of
distributed energy resource (DER) systems (e.g. solar panels feasible solutions increases, it is sometimes very hard (or takes
and small wind turbines), which are often small-scale power an exponentially long time) to find the best solution. Thus, the
generators (typically in the range of 3 kW to 10,000 kW), in time to research for the optimal solution is a very important
order to improve the power quality and reliability [1]. factor.Moreover, it is necessary to study the intrinsic difficulty
of solving mathematical problems, expressed as the
The intermittent and fluctuant generation associated with complexity of the problem. Complexity class describes how
renewable energy sources, lead tothe incorporation of demand/ difficult or easy a problem can be solved.For example, if the
response between source of energy and end users, this made complexity of the function is polynomial in regards to the size
ancillary facilitiesstorage and effective management of energy of the input data, then we say the algorithm runs in polynomial
vital to large scale deploymentof DG. From computation point time and the problem is class P.
of view, management of generation, consumption, and storage
becomes a multi-variable optimization problem. B. NP-hard problem
The time to research the optimal solution in combinatorial
In order to solve the optimization problems related to
optimization problems are considered to be so difficult that the
management objectives, such as improving energy efficiency,
time to find a solution is non-deterministic (NP). NP-hard
controlling emission, reducing cost, profiling demand,optimal
problems are the class of problems that can be resolved in
reactive power dispatch (ORPD) and maximizing
"nondeterministic polynomial time" and therefore are very
utility,researcher have developed multiples mathematical
difficult to solve. We can reduce Problem B (NP) to Problem
tools, modeland solve these optimization problems with an
A (P) if, given a solution to Problem A, we can easily verify
increase complexity that involveuncertainty introduced by
that it is alsoa solution to Problem B. In this case, "easily"
energy. Monte Carlo, game theory and Genetic Algorithms
means "in polynomial time ".
(GA)and other methods canbe used to achieve
thesemanagementobjectives. Thesemethods are classified in to C. Why use Intelligent Algorithms or heuristic?
analytic and heuristic optimization methods[2]. Some combinatorial optimization problems can be solved in
polynomial time as a function of the size of input data.
However, when the exact solution methods are not applicable,
∀𝐭 ∈ 𝟏, … , 𝐓
𝒏𝑮
In [11]
𝑴𝒊𝒏 𝒇 𝑷𝑮 = 𝒇𝒊 𝑷𝑮𝒊
𝒊=𝟏
𝒏
𝑭(𝒙) = 𝑽𝒍 = (𝑳𝒋𝟐 )
𝒋=𝒈+𝟏 In [9]
𝐍
𝐂𝐅(𝐏) = 𝐢=𝟏(𝐂𝐢 𝐅𝐢 (𝐏𝐢)+𝐎𝐌𝐢 (𝐏𝐢 ) + 𝐒𝐓𝐂𝐢 + 𝐃𝐂𝐏𝐄𝐢 − 𝐈𝐏𝐒𝐄𝐢 )
In [6]
𝐍
ug
Di t PDERi t CDERi t + Di t SUCDERi t
T In [4]
+
i=1
ƒ x = ug
t=1
Dj t PESSj t CESSj t + Pgr t Cgr t − Pgs Cgs (t)
j=1
Equality
Papers Inequality constraints State variables
constraints
Voltage limits at communication links. Ploss: Total power losses in the distribution
∆P1=PGt−PLt−Pl
In [13] The limits of the loading factor k. Lines are the 5% value of the former
∆Q1=QGt− QLt−Ql
Generator input power limits. parameter.
𝒏𝑮
𝒏𝒄
𝑷𝑮𝒊 – 𝑷𝒄𝒉𝒋 − 𝑷𝑳 = 𝟎
𝒋=𝟏
𝑷𝒎𝒊𝒏 𝒎𝒂𝒙
𝑮𝒊 ≤ 𝑷𝑮𝒊 ≤ 𝑷𝑮𝒊
𝒊=𝟏
In [9] 𝐦𝐢𝐧
𝐕𝐆𝐢 𝐦𝐚𝐱
≤ 𝐕𝐆𝐢 ≤ 𝐕𝐆𝐢 𝐍 𝐦𝐢𝐧
𝐕𝐆𝐢 𝐦𝐚𝐱
≤ 𝐕𝐆𝐢 ≤ 𝐕𝐆𝐢
𝑷𝒊 = 𝐕𝐢 𝐕𝒋 𝐆𝒊𝒋 𝐜𝐨𝐬 𝛅𝐢𝐣 + 𝐁𝒊𝒋 𝐬𝐢𝐧 𝛅𝐢𝐣
𝐐𝐦𝐢𝐧 𝐦𝐚𝐱
𝐆𝐢 ≤ 𝐐𝐆𝐢 ≤ 𝐐𝐆𝐢 𝐣=𝟏 𝐐𝐦𝐢𝐧 𝐦𝐚𝐱
𝐆𝐢 ≤ 𝐐𝐆𝐢 ≤ 𝐐𝐆𝐢
𝐍
𝐦𝐢𝐧
𝐓𝐆𝐢 𝐦𝐚𝐱
≤ 𝐓𝐆𝐢 ≤ 𝐓𝐆𝐢 𝑸𝒊 = 𝐕𝐢 𝐕𝒋 (𝐆𝒊𝒋 𝐬𝐢𝐧 𝛅𝐢𝐣 + 𝐁𝒊𝒋 𝐜𝐨𝐬 𝛅𝐢𝐣)
𝐣=𝟏
𝐨𝐧
(𝐓𝐭−𝟏,𝐢 − 𝐌𝐔𝐓𝐢 ) (𝐔𝐭−𝟏,𝐢 − 𝐔𝐭,𝐢 )≥ 0
𝐍
𝐨𝐟𝐟
(𝐓𝐭−𝟏,𝐢 − 𝐌𝐃𝐓𝐢 ) (𝐔𝐭−𝟏,𝐢 − 𝐔𝐭,𝐢 )≥ 0
𝐏𝐢 = 𝐏𝐋 − 𝐏𝐏𝐕 − 𝐏𝐖𝐓 − 𝐏𝐛𝐚𝐭𝐭
In [6] 𝐢à𝟏
𝐏𝐢𝐦𝐢𝐧 ≤ 𝐏𝐢 ≤ 𝐏𝐢𝐦𝐚𝐱 ∀𝐢 = 𝟏, … , 𝐍
Ug
ul ug
max
EDERi t PDERi t ≤ EDER
PL t − PDERi t
i=1
Us l=1 i=1
Us
max
EESSi t PESSi t ≤ EESS PDERj (t) − Pgr t + Pgs t = 0
In [4]
j=1
max j=1
Eg (t)Pg (t) ≤ Egrid
Comparing GA with Ant colony, Ant colony approach is the high cost solutions
generation. The computation time for one iteration by ACA leads to very low number of
In [11] Optimization of cost function by determining the
iterations compared to the number of iterations performed by the genetic algorithm.
Optimal power flow
Hybridization of the GA with an exact method, Evolve the GA by a search for a local
optimum and to improve convergence time.
Enhance voltage stability, Decrease power loss by Problem is treated as a single objective problem. The best trade-off relations between
In [9]
minimizing l-indice load buses cost and emission cannot directly find
TABLE IV. SUMMARIZE THEPARAMETERS TAKEN INTO ACCOUNTBYEACHAUTHORS TO TREAT THEIR FITNESS FUNCTION
Reliability
Generating Emission Storage
Papers Fuel Cost cost(maintenance/v Start-up Cost Purchase/sell Cost
Cost Cost Cost/charge discharge
oltage stability)
In[13]
In[11]
In [9]
In [6]
In [4]
TABLE V. SUMMARIZE THEPARAMETERS TAKEN INTO ACCOUNT BY EACH AUTHORS TO TREAT EQUALITY AND INEQUALITY
CONSTRAINTS
Reactive
Active Power Start-up Transformer taps Voltage Active power Reactive power
Paper power
balance time position constraints generate generate
balance
In[13]
In[11]
In [9]
In [6]
In [4]