Allocation of EV Public Charging Station in Renewable Based Distribution Network Using HHO Considering Uncertainties and Tra C Congestion
Allocation of EV Public Charging Station in Renewable Based Distribution Network Using HHO Considering Uncertainties and Tra C Congestion
Allocation of EV Public Charging Station in Renewable Based Distribution Network Using HHO Considering Uncertainties and Tra C Congestion
Research Article
Keywords: Distributed generation, EV charging station, HHO, optimal allocation, 2m PEM, uncertainty
DOI: https://doi.org/10.21203/rs.3.rs-172433/v1
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Read Full License
1
total loss (𝐿𝑜𝑠𝑠𝑇 ) at any hour 𝑡 𝑡ℎ . Therefore, the load 𝑑𝑖𝑓 (ℎ) 𝜁𝑐 (𝑔, ℎ)
𝐴 𝑠𝑜𝑐 (ℎ) = 1 − − , where, 𝐴𝐸𝑅
balancing constraint is written as: 𝐴𝐸𝑅(ℎ) 𝐵𝑐(ℎ) (13)
𝑃𝑠𝑑𝑔 (𝑡) ∪ 𝑃𝑢𝑡 (𝑡) ∈ 𝐿 𝑇 (𝑡) ∪ 𝐿𝑜𝑠𝑠𝑇 (𝑡), ∀ 𝑡 (5) ∈ 𝑓𝑛(ℎ)
Branch thermal limit constraint is provided bellow. 𝐷 𝑠𝑜𝑐 (ℎ) = (𝑆𝑇𝐷(ℎ)⁄𝐴𝐸𝑅(ℎ)) + 0.25 (14)
|𝑆𝑏𝑟 | ≤ |𝑆𝑏𝑟𝑚𝑎𝑥
|, ∀ 𝑏𝑟 (6) where 𝜁𝑐 (𝑔, ℎ) is consumed energy by ℎ𝑡ℎ EV to reach 𝑔𝑡ℎ
where 𝑆𝑏𝑟 is apparent power of branch 𝑏𝑟 and 𝑆𝑏𝑟 𝑚𝑎𝑥
is the PFCS considering traffic congestion, which is calculated as (31)
maximum apparent power limit of 𝑏𝑟 𝑡ℎ branch. in the second stage. 𝑑𝑖𝑓 (ℎ) is the initial first trip distance,
Zone constraint is taken in consideration to make the public 𝐵𝑐(ℎ) is battery capacity, 𝐴𝐸𝑅(ℎ) is all-electric range and
charging station (𝑔) distributed over the city. This will bound 𝑆𝑇𝐷(ℎ) is the subsequent trip distance of ℎ𝑡ℎ vehicle which is
one PFCS in each zone. obtained as (Mehta et al. 2018), by
𝑔𝑖 ∈ ℤ𝑖 , 𝑖 ∈ 𝑛𝑜. 𝑜𝑓 𝑧𝑜𝑛𝑒 (7) 𝑆𝑇𝐷(ℎ) = 𝑑𝑚(ℎ) − 𝑑𝑓𝑓 (ℎ) (15)
where 𝑆𝑖 is the 𝑖 𝑡ℎ EVCS and ℤ𝑖 is the 𝑖 𝑡ℎ zone. where 𝑑𝑓𝑓 (ℎ) is the final first trip distance, which is obtained
The maximum SOC level (𝑆𝑂𝐶𝑚𝑎𝑥 ) and minimum SOC level in the second stage as (30). 𝑑𝑚(ℎ) is daily mileage of ℎ𝑡ℎ
(𝑆𝑂𝐶𝑚𝑖𝑛 ) should be maintained to keep the battery healthy. vehicle in km. Departure time (𝐷𝑡𝑖𝑚𝑒 (ℎ)) of ℎ𝑡ℎ vehicle is
𝑆𝑂𝐶𝑚𝑖𝑛 ≤ 𝑆𝑂𝐶ℎ ≤ 𝑆𝑂𝐶𝑚𝑎𝑥 , ∀ ℎ (8) found out using
where 𝑆𝑂𝐶ℎ is the SOC level of the ℎ𝑡ℎ EV. 𝐷𝑡𝑖𝑚𝑒 (ℎ) = 𝐴𝑡𝑖𝑚𝑒 (ℎ) + 𝑅𝑡𝑖𝑚𝑒 (ℎ) (16)
𝑡𝑖𝑚𝑒
3) Load Modelling where 𝑅 (ℎ) is the required time to attain the desire charge
The total load at 𝑏𝑢𝑡ℎ bus (𝐿(𝑏𝑢, 𝑡)) at any 𝑡 𝑡ℎ time interval level of 𝐸𝑉ℎ , 𝐴𝑡𝑖𝑚𝑒 (ℎ) is the arrival time of ℎ𝑡ℎ vehicle at
is written as follows: PFCS. Required time for charging of 𝐸𝑉ℎ with 𝐶𝑟 charging rate
𝐿(𝑏𝑢, 𝑡) = 𝐶𝐿(𝑏𝑢, 𝑡) + 𝐶𝑆𝐿(𝑏𝑢, 𝑡) is calculated as:
(9)
− 𝑆𝐷𝐺(𝑏𝑢, 𝑡), ∀ 𝑏𝑢, 𝑡 𝑅𝑡𝑖𝑚𝑒 (ℎ) = 𝑅𝑒𝑛𝑔 (ℎ)⁄𝐶𝑟 (17)
where 𝐶𝑆𝐿(𝑏𝑢, 𝑡) is the load due to PFCS at bus 𝑏𝑢, if it is 5) SDG modelling
connected to 𝑏𝑢𝑡ℎ bus, otherwise zero. On the other hand, The main stochastic variable for PV is solar irradiance
𝑆𝐷𝐺(𝑏𝑢, 𝑡) is the generation from PV at bus 𝑏𝑢 , if it is (𝑘𝑊/𝑚2 ). PV cell temperature is also uncertain but it depends
connected to 𝑏𝑢𝑡ℎ bus, otherwise zero. on irradiance only. PV power output at 𝑡 𝑡ℎ hour (𝑃𝑤𝑝𝑣 (𝑡))
The load at 𝑔𝑡ℎ CS at 𝑡 𝑡ℎ time (𝐶𝑆𝐿(𝑔, 𝑡)), which may be will be added in (9) as a negative load and is expressed as
connected to any 𝑏𝑢𝑡ℎ bus, is calculated as follows. (Sultana and Roy 2015):
𝐸𝑉
𝐶𝑆𝐿(𝑔, 𝑡) = ∑ 𝐸𝑉𝐿(𝑔, ℎ, 𝑡), ∀ 𝑡 (10) 𝑆𝐷𝐺(𝑡) = 𝑃𝑤𝑝𝑣 (𝑡) = 𝑃𝑣𝑣𝑎𝑟𝑖 (𝑡) × 𝑃𝑤𝑝𝑣 , ∀ 𝑡 (18)
ℎ=1
𝑡ℎ 𝑡ℎ
where 𝑃𝑣𝑣𝑎𝑟𝑖 is the 24 hours variation of solar irradiance in p.u.
where 𝐸𝑉𝐿(𝑔, ℎ, 𝑡) is the load due to 𝐸𝑉ℎ at 𝑔 CS at 𝑡 hour is followed as (Sultana and Roy 2015). Therefore, at the
when 𝐴𝑡𝑖𝑚𝑒 (𝑔, ℎ) < 𝑡 < 𝐷 𝑡𝑖𝑚𝑒 (𝑔, ℎ) . 𝐴𝑡𝑖𝑚𝑒 (𝑔, ℎ) and endpoint PV power (𝑃𝑤𝑝𝑣 ) is calculated from solar irradiance
𝐷𝑡𝑖𝑚𝑒 (𝑔, ℎ) are the arrival time and departure time respectively (Soroudi et al. 2012) by
of the 𝐸𝑉ℎ at 𝐶𝑆𝑔 . 𝑃𝑤𝑝𝑣 = 𝑁𝑝 ∙ 𝐹𝑓 ∙ 𝑉𝑖𝑟 ∙ 𝐼𝑖𝑟 (19)
4) Energy Requirement of EVs where 𝑁𝑝 is total number of PV module, 𝐹𝑓 is the fill factor is
Arrival time, first trip distance and daily mileage are the
presented as:
uncertain variables for all the EV. Arrival SOC, departure SOC 𝑉𝑚𝑝 ∙ 𝐼𝑚𝑝
and departure time of EV are also uncertain which are 𝐹𝑓 = (20)
calculated based on pre-mentioned uncertainties. Energy 𝑉𝑜𝑐 ∙ 𝐼𝑠𝑐
requirement by an EV depends on the arrival SOC (𝐴𝑠𝑜𝑐 (ℎ)) 𝑉𝑖𝑟 = 𝑉𝑜𝑐 − 𝐶𝑣 × 𝑡𝑐𝑒𝑙𝑙 (21)
and departure SOC(𝐷 𝑠𝑜𝑐 (ℎ)) of the ℎ𝑡ℎ vehicle. The arrival 𝐼𝑖𝑟 = 𝑖𝑟𝑎𝑣𝑔 {𝐼𝑠𝑐 + 𝐶𝑖 (𝑡𝑐𝑒𝑙𝑙 − 25)} (22)
SOC is related to final first trip distance (𝑑𝑓𝑓 (ℎ)) in km, 𝑡𝑐𝑒𝑙𝑙 = 𝑡𝑎𝑚𝑏 + (𝑖𝑟𝑎𝑣𝑔 ∙ (𝑡𝑛𝑜𝑚 − 20)⁄0.8) (23)
whereas departure SOC is associated with subsequent trip where 𝑉𝑚𝑝 and 𝐼𝑚𝑝 are maximum power point voltage and
distance (𝑆𝑇𝐷(ℎ)) in km. Energy requirement (kWh) current respectively. 𝑉𝑜𝑐 and 𝐼𝑠𝑐 are open circuit voltage and
(𝑅𝑒𝑛𝑔 (ℎ)) by ℎ𝑡ℎ EV is evaluated as follows (Mehta et al. short circuit current. 𝑖𝑟𝑎𝑣𝑔 is average solar irradiance, 𝑡𝑐𝑒𝑙𝑙 is
2018). the cell temperature in °C. 𝐶𝑣 and 𝐶𝑖 are voltage and current
𝑅 𝑒𝑛𝑔 (ℎ) = (𝑅 𝑠𝑜𝑐 (ℎ) ∙ 𝐵𝑐(ℎ))⁄𝜂𝑐ℎ , ∀ ℎ, where 𝐵𝑐 temperature coefficient. 𝑡𝑛𝑜𝑚 is nominal operating temperature
(11)
∈ 𝑓𝑛(ℎ) of PV cell. 𝑡𝑎𝑚𝑏 is ambient temperature. The solar irradiance
𝑠𝑜𝑐 (ℎ)
where 𝑅 and 𝐵𝑐(ℎ) indicate required SOC and battery follows beta distribution (Soroudi et al. 2012), which is
capacity of ℎ𝑡ℎ vehicle respectively, 𝜂𝑐ℎ is charging efficiency. demonstrated as follows.
𝑅𝑒𝑞 𝑠𝑜𝑐 is calculated in percentage (Mehta et al. 2018) as 𝑓(𝑖𝑟)
Γ(𝛼𝑖𝑟 + 𝛽𝑖𝑟 )
follows. × 𝑖𝑟 (𝛼𝑖𝑟 −1) × (1 − 𝑖𝑟)(𝛽𝑖𝑟−1) ,
𝑅 𝑠𝑜𝑐
(ℎ) = Γ(𝛼𝑖𝑟 )Γ(𝛽𝑖𝑟 ) (30)
1 − 𝐴𝑠𝑜𝑐 (ℎ), 𝑖𝑓 𝐷 𝑠𝑜𝑐 (ℎ) > 1 𝑖𝑓 0 ≤ 𝑖𝑟 ≤ 1; 𝛼𝑖𝑟 ≥ 0; 𝛽𝑖𝑟 ≥ 0
𝑠𝑜𝑐 𝑠𝑜𝑐
= {(𝐷 (ℎ) − 𝐴 (ℎ), 𝑖𝑓 𝐴𝑠𝑜𝑐 (ℎ) < (𝐷 𝑠𝑜𝑐 (ℎ) < 1 (12) { 0, 𝑒𝑙𝑠𝑒
0, 𝑖𝑓 𝐴𝑣𝑠𝑜𝑐 = (𝐷 𝑠𝑜𝑐 (ℎ) where 𝛼𝑖𝑟 and 𝛽𝑖𝑟 are beta shape parameters. 𝜇𝑖𝑟 and 𝜎𝑖𝑟 are
Arrival SOC (Rezaee et al. 2013) and departure SOC (Mehta the mean and SD of solar irradiance, which is determined as:
et al. 2018) are calculated as (13) and (14) respectively. 𝜇𝑖𝑟 = 𝛼𝑖𝑟 ⁄(𝛼𝑖𝑟 + 𝛽𝑖𝑟 ) (24)
2 (1
Again, from the equation of Greenshields model (Shlayan et
𝜎𝑖𝑟 = √𝜇𝑖𝑟 + 𝜇𝑖𝑟 )⁄(𝛼𝑖𝑟 + 𝜇𝑖𝑟 ) (25)
al. 2018), the modified velocity of the EV due to traffic
congestion is presented as:
B. Stage 2: PFCS Selection by EVs
𝓋𝑚 (𝑔, ℎ, 𝑡) = 𝑣𝑓 (𝑔, ℎ) (1 − 𝑦(𝑔, ℎ, 𝑡) ∙ 𝜏(𝑔, ℎ, 𝑡)
The main goal is to assign each EV to right PFCS by (32)
consuming less quantity of energy while reaching its suggested ∙ ℂ𝑗 (𝑔, ℎ) ∕ 𝕕(𝑔, ℎ))
PFCS. This is determined using integer linear programming where 𝑣𝑓 (𝑔, ℎ) is the free flow velocity and the required time
considering congestions and shortest distances. The shortest 𝜏(𝑔, ℎ, 𝑡) for covering the distance (𝕕(𝑔, ℎ)) with vehicle flow
paths and distances may be identified using Dijkstra's algorithm
(Amaliah et al. 2016). The formulation for optimal section of 𝑦(𝑔, ℎ, 𝑡) by the EV is expressed as (Mkahl et al. 2017):
PFCS by the ILP is discussed below. 𝑣𝑓 (𝑔, ℎ) ∙ 𝑦(𝑔, ℎ, 𝑡)
𝜏(𝑔, ℎ, 𝑡) = 𝑣𝑓 (𝑔, ℎ)/2 ∙ (33)
1) Assignment Matrix for ILP ℂ𝑗 (𝑔, ℎ) ∙ 𝑑(𝑔, ℎ)
The linear programming problem (ILPP) is formulated by an
assignment matrix 𝜓(𝑔, ℎ) (Das et al. 2020) where ℎ >> 𝑔 III. SOLUTION METHODOLOGY
and each EV is assigned to a PFCS. This matrix is grounded on The HHO technique, 2m PEM and the algorithm for this
the renowned assignment problem (Aktel et al. 2017) with the proposed work, are presented below.
combination of traffic flow structure (Schrieber et al. 2017).
Since, traffic flow is a dynamic event, hence, it is expressed as A. Harris Hawks Optimization (HHO)
𝜓(𝑔, ℎ, 𝑡), where, t ∈ 𝑡𝑖𝑚𝑒. The matrix is shown in the Table 1. In 2019, A.A. Heidari et al. introduced the HHO (Heidari et
TABLE 1
al. 2019). This optimization is based on chasing tactic of Harris’
STRUCTURE OF EV ASSIGNMENT MATRIX TO THE PFCS
𝐸𝑉1 𝐸𝑉2 𝐸𝑉3 … 𝐸𝑉ℎ hawks to its target. The key steps are instructed as follows
𝐶𝑆1 𝜓(1,1, 𝑡) 𝜓(1,2, 𝑡) 𝜓(1, 3, 𝑡) … 𝜓(1, ℎ, 𝑡) (Heidari et al. 2019).
𝐶𝑆2 𝜓(2,1, 𝑡) 𝜓(2,2, 𝑡) 𝜓(2,3, 𝑡) … 𝜓(2, ℎ, 𝑡) 1) Initialization
⋮ ⋮ ⋮ ⋮ ⋮ ⋮ Decision variables (𝐾ij ) , preliminary energy (𝐸𝑛0 ) and
𝐶𝑆𝑔 𝐴(𝑔, 1, 𝑡) 𝜓(𝑔, 2, 𝑡) 𝜓(𝑔, 3, 𝑡) … 𝜓(𝑔, ℎ, 𝑡)
jump strength (𝐽𝑠) are initialized as follows.
2) Objective Function-2 (𝐹2 ) 𝐾𝑖𝑗 = 𝐾𝑗𝑚𝑖𝑛 + 𝑟𝑎𝑛𝑑(𝐾𝑗𝑚𝑎𝑥 − 𝐾𝑗𝑚𝑖𝑛 ), 𝑤ℎ𝑒𝑟𝑒 𝑖
(34)
In this formulation, the main objective is to keep the battery = 1,2,3 … 𝑆𝑝 ; j = 1,2,3 … 𝐷𝑛
energy consumption minimum by the EV to reach at PFCS 𝐸𝑛0 = 2 ∙ 𝑟𝑎𝑛𝑑(−1, 1) − 1 (35)
considering traffic congestions at time 𝑡, i.e. 𝐽𝑠 = 2(1 − 𝑟𝑎𝑛𝑑(0, 1)) (36)
𝐶𝑆 𝐸𝑉
2) Update part
𝐹2 = 𝑚𝑖𝑛 {∑ ∑(𝜁𝑐 (𝑔, ℎ, 𝑡) ∙ 𝜒(𝑔, ℎ, 𝑡))} (26) The energy (𝐸𝑛) is updated in every iteration (𝑡) as:
𝑔=1 ℎ=1 𝑡
𝜒(𝑔, ℎ, 𝑡) 𝐸𝑛 = 2 ∙ 𝐸𝑛0 (1 − ) (37)
𝑇
1, if 𝐸𝑉ℎ 𝑖s assigned to 𝐶𝑆𝑔 at time 𝑡 (27) where number of iteration is 𝑇. Decision vector (𝐾 (𝑍+1) ) is
={
0, otherwise updated according to various situations as follows.
3) Constraints
𝑐𝑠 Exploration phase (if |En|≥1)
∑ 𝜒(𝑔, ℎ, 𝑡) = 1, ∀ 𝐸𝑉ℎ 𝐾 (𝑍+1)
(28) (𝑍) (𝑍)
𝑔=1 𝐾𝑟𝑎𝑛𝑑 − 𝑚1 |𝐾𝑟𝑎𝑛𝑑 − 2𝑚2 𝐾 (𝑍) | , 𝑖𝑓 𝑞 ≥ 0.5 (38)
={
(𝑔, ℎ) ≤ 𝑑𝑓𝑓 (ℎ) (29) (𝑍)
𝐾𝑟𝑎𝑏𝑏𝑖𝑡 −
(𝑍)
𝐾𝑚 − 𝑚3 (𝐿𝐿 + 𝑚4 (𝑈𝐿 − 𝐿𝐿)), 𝑖𝑓 𝑞 < 0
𝑑𝑓𝑓 (ℎ) ∈ 𝑑𝑖𝑓 (ℎ) ∪ 𝕕(𝑔, ℎ) (30) (𝑍)
where 𝑍 is iteration number, 𝐾𝑟𝑎𝑏𝑏𝑖𝑡 is the position of the
where in (28), 1 ≤ ℎ ≤ 𝐸𝑉 and each EV is assigned to only one (𝑍)
PFCS at a time. In (29), the final first trip distance should not rabbit. 𝐾𝑟𝑎𝑛𝑑 is randomly selected hawk position.
be the lower than the distance of 𝐸𝑉ℎ from 𝐶𝑆𝑔 charging 𝑚1 , 𝑚2 , 𝑚3 , 𝑚4 and 𝑞 is random number ∈ [0, 1]. 𝑈𝐿 is upper
stations 𝕕(𝑔, ℎ). limit and 𝐿𝐿 is lower limit of the decision variables.
4) Energy modelling of EVs Exploitation phase (𝑖𝑓 |𝐸𝑛| < 1)
In order to model the energy consumption by the EV The different conditions in this phase as follows, where 𝑟 is
considering traffic congestions and distance, various factors the possibility of a rabbit can run away.
such as the distance between the location of the vehicle and the Soft besiege (𝑖𝑓 𝑟 ≥ 0.5 𝑎𝑛𝑑 |𝐸𝑛| ≥ 0.5)
(𝑍)
charging station, vehicles speed considering congestion 𝐾 (𝑍+1) = ∆𝐾 (𝑍) − 𝐸|𝐽𝑠 ∙ 𝐾𝑟𝑎𝑏𝑏𝑖𝑡 − 𝐾 (𝑍) | (39)
(𝓋𝑚 (𝑔, ℎ, 𝑡)) , all electric range (AER) of the individual Hard besiege (𝑖𝑓 𝑟 ≥ 0.5 𝑎𝑛𝑑 |𝐸𝑛| < 0.5)
vehicles, battery capacity of the EV, vehicles flow (𝑦(𝑔, ℎ, 𝑡)) (𝑍)
𝐾 (𝑍+1) = 𝐾𝑟𝑎𝑏𝑏𝑖𝑡 − 𝐸|∆𝐾 (𝑍) | (40)
and jam coefficient (ℂ𝑗 (𝑔, ℎ)) are considered [25]. The Soft besiege with progressive rapid dives (𝑖𝑓 𝑟 <
consumed energy by 𝐸𝑉ℎ considering the vehicles flow and 0.5 𝑎𝑛𝑑 |𝐸𝑛| ≥ 0.5)
traffic congestions it is written as (Mkahl 2015): 𝐴, 𝑖𝑓 𝐹(𝐴) < 𝐹(𝐾 (𝑍) )
𝐵𝑐(ℎ) ∙ 𝜏(𝑔, ℎ, 𝑡) ∙ 𝓋𝑚 (𝑔, ℎ, 𝑡) 𝐾 (𝑍+1) = { (41)
𝜁𝑐 (𝑔, ℎ) = (31) 𝐵, 𝑖𝑓 𝐹(𝐵) < 𝐹(𝐾 (𝑍) )
𝐴𝐸𝑅 ∙ ℂ𝑗 (𝑔, ℎ)
5
Hard besiege with progressive rapid dives (𝑖𝑓 𝑟 < is calculated using
𝑁𝑂
0.5 𝑎𝑛𝑑 |𝐸𝑛| < 0.5) 𝑘 𝑘
𝑋, 𝑖𝑓 𝐹(𝐴) < 𝐹(𝐾 (𝑍) ) 𝔼 [(𝑅𝑙 − 𝜇𝑅𝑙 ) ] = ∑(𝑅𝑙,𝑗 − 𝜇𝑅𝑙 ) ∙ ℙ(𝑅𝑙,𝑗 ),
(53)
𝐾 (𝑍+1) = { (42) 𝑗=1
𝑌, 𝑖𝑓 𝐹(𝐵) < 𝐹(𝐾 (𝑍) ) 𝑘 ∈ 3,4
Detail information about the variables used in above steps are where 𝑅𝑙,𝑗 is the value produced from distribution function at
available in (Heidari et al. 2019). 𝑗𝑡ℎ observation, 𝑁𝑂 is the number of inspection of 𝑅𝑙 . ℙ(𝑅𝑙,𝑗 )
B. Hong’s 2m-Point estimation Method signifies the probability density of 𝑅𝑙,𝑗 . 𝑅𝑙 is generated by (54)
for normal distribution.
Hong’s 2m PEM (Hong 1998) is applied in this work which
𝑅𝑙 = 𝜇𝑢𝑣 + (𝕫 × 𝜎𝑢𝑣 ), 𝑙 ∈ 1,2,3, … , 𝑚 (54)
is an effective statistical technique to handle multiple
where 𝜇𝑢𝑣 and 𝜎𝑢𝑣 is the mean and SD of the uncertain variable
uncertainties. The objective functions (𝐹1 , 𝐹2 ) are modified to
𝑢𝑣 respectively, 𝕫 is the standard normal random value. The
mean values (𝜇𝐹1 , 𝜇𝐹2 ) according to 2m PEM as follows. probability density of 𝑅𝑙 is obtainable by
𝑀𝑖𝑛(𝐹) = 𝑀𝑖𝑛(𝜇𝐹), 𝑤ℎ𝑒𝑟𝑒 𝐹 ∈ 𝐹1 𝑜𝑟 𝐹2 (43) 2 2
−[(𝑅𝑙 −𝜇𝑅𝑙 ) ⁄2(𝜎𝑅𝑙 ) ]
𝜇𝐹 = 𝐹(1) (44) ℙ(𝑅𝑙 ) = (𝑒 ) /√2𝜋𝜎𝑅𝑙 2 (55)
Standard deviation (SD) of objective function is calculated by
𝜎𝐹 = √(𝐹(2) − (F(1))2 ) (45) C. Algorithm of Proposed Work
where 𝐹(1) is the first moment and 𝐹(2) is the and second Start
moment of the objective function (𝐹), which are obtained as Initialization
follows. 1. Initialize the decision variables (PFCS locations, SDG locations,
𝑚 2 SDG sizes).
ℎ Objective Function Calculation
𝐹(ℎ) = ∑ ∑ (𝑤𝑙,𝑝𝑜 (𝐹𝑙,𝑝𝑜 ) ) , ℎ ∈ 1,2 (46)
2. Set time interval, 𝑡 = 0.
𝑙=1 𝑝𝑜=1
(−1)𝑝𝑜 𝜉𝑅𝑙,(3−𝑝𝑜) 3. Find out the shortest path and distance to the PFCSs from the
𝑤𝑙,𝑝𝑜 = ∙ , 𝑝𝑜 ∈ 1,2 (47) EVs at 𝑡 𝑡ℎ time interval using Dijkstra's algorithm
𝑚 𝜉𝑅𝑙 ,1 − 𝜉𝑅𝑙 ,2 4. Find out the energy consumption by the EVs to reach PFCSs
𝐹𝑙,𝑝𝑜 = 𝑓(𝐷𝑣 , 𝜇𝑅1 , 𝜇𝑅2 , … , 𝑧𝑙,𝑝𝑜 , … , 𝜇𝑅𝑚 ), considering congestions using (31).
(48)
Under 2m PEM
𝑝𝑜 ∈ 1,2; 𝑙 ∈ 1,2,3, … , 𝑚 5. Assign the EVs to apt PFCS by consuming the least energy
𝑡ℎ using ILP.
where 𝐹(ℎ) is the ℎ moment of 𝐹 . 𝑝𝑜 ∈ 1, 2 generate two
6. Calculate the final energy requirement by the EVs using (11).
weighting factors (𝑤𝑙,𝑝𝑜 ) of 𝑧𝑙 . 𝑚 represents the number of 7. Calculate the total load for every PFCS at 𝑡 𝑡ℎ time interval.
uncertain variable. 𝜉𝑅𝑙 is the standard location of 𝑅𝑙 . 𝐷𝑣 is 8. Find the SDG generations at 𝑡 𝑡ℎ time interval.
deterministic variable, 𝜇𝑅𝑙 is the mean of the 𝑙 𝑡ℎ uncertain 9. Run the backward forward sweep load for to calculate power
loss at 𝑡 𝑡ℎ time interval.
variable. 𝑧𝑙,𝑝𝑜 is definite positions of the input variable. 10. 𝑡 = 𝑡 + 1.
2 × 𝑚 number of sets are created using (48). The objective 11. Go to next step if 𝑡 = 𝑇, otherwise go to step 3.
functions 𝐹1 and 𝐹2 are calculated for all stochastic set clubbed 12. Calculate the energy loss.
with a fixed deterministic set. In this present work, the sizes of 13. Calculate the mean and SD of the objective function
the SDG and locations of the PFCS and SDG are the Update
14. Update the decision variables using optimization techniques.
deterministic variables (𝐷). The PEM sets are expressed as:
15. Go to next step if optimization is converged, otherwise go to
𝑓(𝐷𝑣 , 𝜇𝑅1 , 𝜇𝑅2 , … , 𝑧𝑙,𝑝𝑜 , … , 𝜇𝑅𝑚 ) step 2.
𝐷1 𝐷2 … 𝐷𝑛 𝑧1,1 𝜇𝑅2 𝜇𝑅3 … 𝜇𝑅𝑚 16. Display the optimized results.
𝐷1 𝐷2 … 𝐷𝑛 𝑧1,1 𝜇𝑅2 𝜇𝑅2 … 𝜇𝑅𝑚 end
𝐷1 𝐷2 … 𝐷𝑛 𝜇𝑅1 𝑧2,1 𝜇𝑅3 … 𝜇𝑅𝑚
= 𝐷1 𝐷2 … 𝐷𝑛 𝜇𝑅1 𝑧2,2 𝜇𝑅3 … 𝜇𝑅𝑚 (49) IV. SIMULATION STUDY
⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮
𝐷1 𝐷2 … 𝐷𝑛 𝜇𝑅1 𝜇𝑅2 𝜇𝑅3 … 𝑧𝑚,1 A. Input Data
[⏟𝐷1 𝐷2 … 𝐷𝑛 ⏟ 𝜇𝑅1 𝜇𝑅2 𝜇𝑅3 … 𝑧𝑚,2 ]
𝐷𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑖𝑠𝑡𝑖𝑐𝑠 𝑆𝑡𝑜𝑐ℎ𝑎𝑠𝑡𝑖𝑐 𝑃𝑎𝑟𝑡
𝑃𝑎𝑟𝑡
where 𝑛 is the number of deterministic variable.
𝑧𝑙,𝑝𝑜 = 𝜇𝑅𝑙 + (𝜉𝑅𝑙 ,𝑝𝑜 × 𝜎𝑅𝑙 ), 𝑝𝑜 = 1,2 (50)
where 𝜎𝑅𝑙 is the standard deviation of the uncertain variable.
𝜆𝑅𝑙 ,3
𝜉𝑅𝑙 ,𝑝𝑜 = + (−1)3−𝑝𝑜 √𝜆𝑅𝑙 ,4 − 3𝜆2𝑅𝑙 ,3 ⁄4 ,
2 (51)
𝑝𝑜 ∈ 1,2
where 𝜉𝑅𝑙 ,𝑝𝑜 is the 𝑝𝑜 𝑡ℎ standard location of 𝑅𝑙 . 𝜆𝑅𝑙 ,3 and 𝜆𝑅𝑙 ,4
are the coefficient of third central moment//skewness and
coefficient of fourth central moment/kurtosis of 𝑅𝑙 Fig. 1. Superimposed study area with power distribution and traffic network.
respectively.
𝑘 𝑘
𝜆𝑅𝑙,𝑘 = 𝔼 [(𝑅𝑙 − 𝜇𝑅𝑙 ) ]⁄(𝜎𝑅𝑙 ) , 𝑘 ∈ 3,4 (52) Figure 1 shows the area, where a 33 node distribution
𝑘 network (Amiri et al. 2018) is overlapped with a traffic
where 𝔼 is the notation for expected value and 𝔼 [(𝑅𝑙 − 𝜇𝑅𝑙 ) ]
network. Zone wise allocation of PFCS is necessary for well 2014; Bodo et al. 2017). The arrival SOC is limited to 25 – 90%
accessibility of charging station to all EV users in a city. (Shafie-khah et al. 2016; Pal et al. 2021).
Therefore, three zones are identified based on the vehicle TABLE 4
ELECTRIC VEHICLE TYPES AND SPECIFICATIONS (MEHTA ET AL. 2018)
density caused by market place, housing area, land accessibility Type Battery AER Presence (%)
and road arrangement. of EV Capacity (kWh) (km) in the Area
Three different types of roads are taken here, where the T1 13.8 48.27 60
busiest road is type 1, next to it is the type 2 and the least busy T2 18.4 64.36 30
T3 24 117 10
roads are type 3. Based on one year’s vehicle behaviours, it is
observed that the peak vehicle flow varies 500-1000 vehicle/hr Different types of vehicle are present in a city with different
for different sections of the roads and figure 2 shows the hourly battery capacities. Hence, three types of EV are taken in this
profile of vehicle flow of the three types of road. Table 2 present work and shown in Table 4. Total 200 EVs are considered in
the jam coefficients (Mkahl et al. 2017) for different types of the proposed study area.
the road.
B. Simulation Case Study
In this work, the simulations are performed in MATLAB
coding platform in a computer with Intel Core i5, 8 GB ram.
Three case studies are conducted to check the performances of
the proposed allocation strategy considering the uncertainties
by 2m PEM. The case studies are defined as follows:
1) Case-1: In this study, the PFCSs are allocated without the
presence of SDG and the EVs are not assigned at apt PFCSs
using ILP, rather it is coming to CS whichever is nearest by
Dijkstra's algorithm.
Fig. 2. Annual average vehicle flow profile of three types of road.
2) Case-2: This case is also for PFCS allocation without SDG
TABLE 2 but EVs are assigned at proper PFCSs considering the traffic
ELECTRIC VEHICLE TYPES AND SPECIFICATION congestions and distances by ILP and Dijkstra's algorithm.
Road Type 1 Road Type 2 Road Type 3 3) Case-3: In this study, the optimized sizes and locations of
Jam Coefficient 250 200 150 SDG are achieved along with PFCS locations, where apt choice
of PFCSs by the EVs is also taken into account.
The distribution, mean value, standard deviation and Table 5 and Table 6 present the solutions for the case-1 and
maximum, minimum values of different variables associated case-2 respectively for 100% EV penetration, where the optimal
with EVs are presented in Table 3 and the uncertain data related locations of PFCS using GWO and HHO are shown with
to solar PV are taken as (Soroudi et al. 2012). Annual average
minimized means of the energy loss and obtained standard
PV profile and conventional load profile are shown in Figure 3
deviations.
as (Pal et al. 2020). TABLE 5
TABLE 3
ALLOCATED LOCATIONS OF PFCS AND ENERGY LOSS FOR CASE-1 WITH 100%
DISTRIBUTION DETAILS FOR UNCERTAIN PROPERTIES OF EV
EV PENETRATION
Variable Unit Distribution Mean Std. dev. Min Max
Optimization PFCS Location Mean Energy Loss SD Energy loss
Truncated Gaussian Technique (Node) (kWh) (kWh)
Arrival time hour (Shafie-khah et al. 12 5 4 24
GWO 2 10 28 4940.9903 26.5687
2016)
HHO 2 10 28 4940.9903 26.5687
Normal (Mehta et al.
Daily mileage km 55 10 0 -
2018)
First trip Normal (Mehta et al. TABLE 6
km 19.25 7.95 0 - ALLOCATED LOCATIONS OF PFCS AND ENERGY LOSS FOR CASE-2 WITH 100%
distance 2018)
EV PENETRATION
Optimization PFCS Location Mean Energy Loss SD Energy loss
Technique (Node) (kWh) (kWh)
GWO 2 16 28 4336.6315 24.3021
HHO 2 16 28 4336.6315 24.3021
the EVs. However, in case-2, the energy requirement by the the allocation of PFCSs at apt locations considering proper
EVs to travel up to PFCSs are also taken care, which helps to assigned EVs to the PFCSs by ILP. For case-3, the voltage
reduce the SOC requirement of the EVs. Hence, for the profile is far improved due to the allocations of SDGs.
locations of node 2, 16 and 28, the energy loss is less due to less
C. Sensitivity Analysis
energy demand by the EVs compared to case-1.
The allocation results of PFCSs and SDGs are shown in The same three cases are performed with 50% EV
Table 7 with 100% EV penetration. In this case, HHO obtains penetration and Table 8 shows the respective results. It shows
less energy loss by allocating SDG at proper locations with apt that the locations of the PFCS and SDG with 50% EV
sizes w.r.t. GWO. It is seen from Table 6 and Table 7 that one penetration are same as locations in case of 100% EV
location of PFCS is changed from node 28 to 31 in case-3 for penetration for all the three cases, which confirm the robustness
the simultaneous allocation of PFCSs and SDGs. Significant of the solutions. Also, both the optimization techniques are
energy loss reduction is achieved in case-3 due to the optimal reached to the same solutions for all the cases with 50% EV
presence of SDGs. penetration scenario. Like 100% EV penetration, the energy
TABLE 7 loss is more for case-1, and reduced in case-2. Case-3 offers the
LOCATIONS OF PFCS AND LOCATIONS WITH SIZES OF SDG FOR CASE-3 WITH best among all with least energy loss. However, the energy
100% EV PENETRATION losses are less compared to 100% EV penetration.
Optimization Technique GWO HHO
TABLE 8
PFCS Location (Node) 2 16 31 2 16 31 SOLUTIONS FOR CASE-1 TO CASE-3 WITH 50% EV PENETRATION
SDG Location (Node) 3 14 30 24 14 30
Optimization Technique GWO HHO
SDG size (MW) 2.2354 1.1075 1.3128 1.4046 1.1417 1.3904 PFCS Location (Node) 2 10 28 2 10 28
Mean Energy Loss (kWh) 2961.0982 2918.5838 Case-1 Mean Energy Loss (kWh) 4573.6032 4573.6032
SD Energy loss (kWh) 28.4861 28.8568 SD Energy loss (kWh) 18.2569 18.2569
PFCS Location (Node) 2 16 28 2 16 28
Again it is noticed from Table 5-7, that both the optimization Case-2 Mean Energy Loss (kWh) 4190.3649 4190.3649
techniques provide the same solution for case-1 as well as for SD Energy loss (kWh) 17.0458 17. 0458
PFCS Location (Node) 2 16 31 2 16 31
case-2. But in case-3, HHO performs better than GWO. Figure SDG Location (Node) 24 14 30 24 14 30
4 depicts the convergence curves for all the cases with 100% Case-3 SDG size (MW) 1.396 1.054 1.371 1.396 1.054 1.371
EV penetration. It is observed in Figure 4 that the HHO Mean Energy Loss (kWh) 2894.4277 2894.4277
converged before the GWO. Moreover, HHO provides better SD Energy loss (kWh) 25.4753 25.4753
loss minimization in case-3 compared to GWO.
Figure 6 shows the energy loss comparisons between 100%
and 50% EV penetration and it is visualized that the energy
losses are less for all cases in 50% EV penetration scenario
compare to 100% penetration because of less number of EV
creates comparatively less load and less energy demand in the
system. Energy losses are also decreasing from case-1 towards
case-3 for both the EV penetration level due to case wise
development, i.e. apt assignment of EV at PFCSs and allocation
of SDGs at proper nodes with suitable sizes.
Fig. 4. Convergence curves of GWO and HHO for case-1 to 3 with 100% EV
penetration.
Fig. 6. Comparison of all the cases with 100% and 50% EV penetration.
Figure 1
Figure 3
Annual average vehicle ow pro le of three types of road (Pal et al. 2020).
Figure 4
Convergence curves of GWO and HHO for case-1 to 3 with 100% EV penetration
Figure 5
Daily average voltage pro les of the distribution network for case-1 to 3 with 100% EV penetration.
Figure 6
Figure 7