Meta Heuristic Algorithm Based Multi Objective Optimal Planning of Rapid Charging Stations and Distribution Generators in a Distribution System Coupled with Transportation Network

POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER Meta Heuristic Algorithm Based Multi Objective Optimal Planning of Rapid Charging Stations and Distribution Generators in a Distribution System Coupled with Transportation Network Vijay VUTLA , Venkaiah CHINTHAM , Vinod Kumar Dulla MALLESHAM Department of Electrical Engineering, National Institute of Technology Warangal, NH 163, NITW Campus, 506004 Hanamkonda, Telangana, India vutlavijay[email protected], ch.venk[email protected], vino[email protected] DOI: 10.15598/aeee.v20i4.4594 Article history: Received Jun 10, 2022; Revised Sep 22, 2022; Accepted Oct 13, 2022; Published Dec 31, 2022. This is an open access article under the BY-CC license. Abstract. The application of Electric Vehicles (EVs) is increasing in many countries, causing many researchers to focus on EV Rapid Charging Station (RCS) related issues. The optimal planning of RCS considering only distribution networks is not a reliable approach. Moreover, the RCS location should be convenient to the EV user in a given EV driving range and the performance of the distribution system. In this paper, a multi-objective approach for optimal planning of RCS and Distributed Generators (DG) in a distributed system coupled with a transportation network is analyzed. The proposed optimal planning method aims to achieve reduced active power loss, EV user costs, and voltage deviation for effective RCS and DG planning. The approach includes the analysis of the test system with the base case, solo planning of RCS, planning of DGs with fixed RCS, and simultaneous optimal planning of RCS and DGs. Daily load variation at buses and hourly charging probability of EVs have been used in the analysis. IEEE 33 bus distribution system superimposed with a 25-node transportation network is considered the test system. Rao 3 algorithm is applied for optimization, and the results have been compared with PSO and JAYA algorithms. Keywords Distributed Generator, distribution system, electric vehicle, Rao 3 algorithm, Rapid Charging Station. 1. Introduction Greenhouse gas emission, depletion of fossil fuels, and growing oil prices are favouring the choice of EVs for transportation [1]. The deployment of 20 million Electric Vehicles (EVs) globally was a promising beginning to reduce greenhouse gas emissions by 2020. Such a global deployment of EVs will replace 62 % of fleet vehicles by 2050 [2]. Although EVs have several advantages, they also have the drawback of low driving range. The charging time and limited driving range of EVs are the major reasons for the slow expansion of EVs [3]. Installing proper charging infrastructure can mitigate the problem of low driving range. There are three charging methodologies, among them level 1 and level 2 take a few hours for charging while DC rapid charging takes 15–20 minutes for charging [4]. So the deployment of RCS can make the customers switch to EVs as RCS can quickly charge. However, the growth of the EV population creates a negative effect on power sector [5]. The placement of RCS at improper locations can further enhance the harmful impact on the distribution system that alters the healthy operating conditions of the power system [6]. The RCS hurts the distribution system. In the literature, most of the authors concentrated on the minimization of power loss and voltage deviation as objectives to support distribution systems in the presence of charging stations. In [7], minimization of investment cost, connection cost, total cost of losses, and Demand Response (DR) cost were used as objectives for ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 493 POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER placing RCS optimally. The concept of an incentivebased demand response program was used to achieve the objective. For the best positioning of charging stations and distributed generators, the author in [8] used hybrid grey wolves and the particle swarm optimization method. The authors of [9] proposed a methodology for scheduling EV in both V-G and G-V modes in the presence of DG to reduce network power loss and enhance the voltage profile. In [10], the authors have proposed a two stage approach for optimal planning of Distributed Generators (DGs), Shunt Capacitors (SCs) and charging stations with grass-hopper optimization based fuzzy multi-objective technique. The optimal planning of DGs and SCs have been done in the first stage and the planning of CS is done in the second stage. The above literature considered electrical networks only as a test system. However, considering of only electrical networks for charging station placement is not a credible approach. As there is a requirement for placing Rapid Charging Stations (RCS) along urban roads to increase the utilization of EVs, there is a necessity to consider the road network along with electrical network. Very few authors have considered both electrical and road networks for optimal planning of charging stations. The author of [11] proposed a method for positioning and sizing the Fast Charging Station (FCS). In addition, to reducing power loss and waiting times, FCS positioning is done as efficiently as possible to compensate for reactive power. In [12], the best site for Charging Stations (CS) was determined by minimizing power loss and EV energy loss incurred during the trip to CS. The queuing theory was employed by the author to capture the dynamic behavior of CS serviceability. In [13], [14], [15], and [16], authors formulated the multi objective problem for optimal planning of charging stations. In [13], optimal planning was done with the goals of reducing voltage variation and power loss, maximization of EV flow supplied by the fast-charging station with confirming the impact of service radius and waiting time on planning. In [14], the authors applied meta-heuristic algorithms to solve the problem to reduce energy loss, voltage deviation and to minimize the land cost to support maximum EVs with low establishment cost. Minimization of the VRP (Voltage deviation, Reliability, and Power loss) index, installation and operation cost, and improving accessibility index was considered for optimal planning of charging stations in [15]. In [16], the authors used the NSGA algorithm for the simultaneous placing and sizing of FCS. Minimization of investment cost, energy losses, waiting time for charging, and maximization of captured traffic flow are considered for optimal planning. In [17], the author used a heuristic technique for optimal planning of DGs and D-statcom. Voltage Stability Index (VSI) was considered for optimal planning of D-statcom and Loss sensitivity factor is used for optimal planning of DGs. In [18], the author used multi-objective bat algorithm for optimal planning of DGs, here maximization of voltage sensitivity index is used for optimal placement and the minimization of total active power loss is used for optimal sizing of DGs. In [17] and [18], the authors placed DGs in the Distribution System (DS) for improving the performance of DS. In the literature, authors in [7] considered only DS for RCS planning and authors in [8], [9] and [10] planned RCS and DGs on DS only. Authors in [11], [12], [13], [14], [15], and [16] considered coupled network for planning, and yet only RCS is optimally planned. However, optimal planning of RCS and DGs has to be done on superimposed network of electrical network and road network. Because EV users always choose the closest RCS to charge their vehicles, considering the road network is crucial for effective planning. Even when RCS is positioned at the optimal locations, their presence would increase power loss and voltage deviation. In this regard, DG integration is a feasible solution to address the aforementioned issues. Hence, in this paper, both the electrical network and the road network were taken into consideration while determining the best location for RCS and DGs. In addition to the other two goals of minimizing active power loss and voltage deviation, the placement also considered customer convenience through the minimization of EV user costs. Mostly in literature, authors used the grey wolf optimization algorithm, grass hopper optimization algorithm, chicken swarm optimization, and their hybrid forms for finding optimal solutions. However, most algorithms are parameter dependent and require better tuning of parameters for finding optimal and accurate solutions. In this paper, the authors used parameter less novel Rao 3 algorithm for obtaining the optimal solutions. The main contributions of this paper are listed below. •The optimal placement and sizing of RCS and DGs have been done on the superimposed electrical and road network. Integration of DGs in a distribution system counters the negative effects caused by the presence of RCS. •Minimization of Electric vehicle energy loss for travelling from the current position to the charging station location is adequately dealt with. •The analysis takes into account different load types, their variation over 24 hours, and the probability of daily hourly EV charging. ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 494 POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER •For getting the best RCS and DG locations and sizes in a superimposed network, three cases are taken into consideration: case 1 is optimal RCS planning alone; case 2 is optimal DG planning with case 1’s fixed RCS locations and sizes; and case 3 is concurrent optimal RCS and DG planning. •For the goal of tackling an optimization issue, the novel Rao 3 algorithm is chosen, and the solutions are compared with those obtained using the PSO and JAYA algorithms. The organization of the remaining paper is as follows: DG modelling and objective function formulation are explained in Sec. 2. Section 3. explains Rao 3, Jaya algorithms, and flow chart of implementation of Rao 3 algorithm for solving the problem. Results are discussed in Sec. 4. , followed by conclusions in Sec. 5. 2. Problem Formulation 2.1. DGs Modeling PV or PQ modelling can be used to model distributed generators. In this paper, PQ (negative load model) mode has been taken for modelling DGs. Here the quantities that are emphasized real power output (Pdg) and power factor (p.f). Reactive power output (Qdg) can be calculated from the relation governing real power, reactive power, and power factor as shown in Eq. (1). Eq. (2) and Eq. (3) show the calculation of real effective load (Peffectiveload) and reactive effective load (Qeffectiveload) at distribution buses, respectively. Qdg =Pdg tan(cos−1(pf)),(1) Peffectiveload =Pload −Pdg,(2) Qeffectiveload =Qload −Qdg.(3) 2.2. Multi Objective Function (MOF) In this paper, the minimization of active power loss, EV user cost and voltage deviation were considered for optimal planning of charging stations and DGs. Here the weighted multi-objective formulation was done with equal weights. MOF = min(w1AP LRI +w2MV DRI +w3EV UCI). (4) In Eq. (4) w1,w2, and w3are weights between [0,1] and the sum of these weights needs to be 1. In this paper, equal weights are considered for all individual objectives. 1) Active Power Loss Reduction Index (APLRI) Power flow in a distribution system causes active Power loss (Ploss). The addition of Rapid Charging Stations (RCS) to the distribution system puts more strain on the network, resulting in higher power losses and voltage magnitude degradation of buses. Further, the placement of RCS at improper places increases losses abnormally and alters the healthy voltage profile. Usually, RCS is considered as the load at the power distribution substation. Mathematically, the load due to EVs at ith RCS (CSi load) is calculated as per Eq. (5). The connectors at ith RCS (CSi connectors) and the capacity of ith RCS (CSi capacity) are calculated using Eq. (6) and Eq. (7), respectively. Power losses can be reduced by minimizing the Active Power Loss Reduction Index (APLRI). Here APLRI (Eq. (8)) is the ratio of daily Ploss after the placement of CS or DG or both, to the daily Ploss before the placement of both. CSi load =NiCS ev ,(5) CSi connectors = max(Pevc)NiCS ev ,(6) CSi capacity =CSi connectorsRc,(7) AP LRI =P24 t=1 Pfcs/dg loss P24 t=1 Ploss .(8) 2) EV User Cost Index (EVUCI) Electric vehicle user has a choice to select the nearest RCS to charge their EV. This decision not only helps the user but also reduces the energy loss from travelling to the RCS. Consider mpossible charging station locations and qcharging demand nodes which belong to road network nodes. The selection of RCS in optimal planning is done by the calculation of the distance between qth demand node to all available RCS and is stored in Dmatrix with the order of [q, z]z∈m. After comparing the distances of qth demand node to all RCS, EVs present at the demand node are assigned to the nearest RCS and the corresponding distance is stored in DD matrix. Here DD matrix has the order of [q, 1]. D=      d1c1d1c2. . . d1cz d2c1d2c2. . . d2cz . . .. . .. . .. . . dqc1dqc2. . . dqcz      ,DD =      min() min() . . . min()      , (9) ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 495 POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER d=[d1, d2, . . . , dq] is the set of demand points, c=[c1, c2, . . . , cm] is the set of charging nodes belonging to road network nodes. EV user cost can be calculated from Eq. (10). Here Nev(i)is total number of EVs at ith RCS, EC is the energy consumption of EVs and Peis the electricity price. EV usercost = q X n=1 DD(i)Nev(i)ECPe.(10) Calculating the distance from qth demand node to all mcharging nodes and choosing the longest distance among them offers the maximum distance that an EV customer must travel from the qth demand node. DDmax is the result of forming a DD matrix for maximum distances. The values of maximum EV user loss cost and EV user cost index are given by the Eq. (11) and Eq. (12). EV max usercost = q X n=1 DDmax(i)Nev(i)ECPe,(11) EV UCI =EV usercost EV max usercost .(12) 3) Maximum Voltage Deviation Reduction Index (MVDRI) Loading the distribution system with RCS can cause a deviation of voltage beyond its limits. The AC load flow gives the value of the voltage at each bus. The maximum voltage deviation (V Dmax) can be calculated using Eq. (13). Maximum voltage deviation: V Dmax = max(1 −v(i)), i = 1,2,3, . . . , Ndistnodes. (13) MVDRI refers to the ratio of maximum voltage deviation over the day with the integration of RCS/DG or both to the maximum voltage deviation over the day without the integration of both RCS and DG. It is calculated as follows: MV DRI =P24 t=1 V DRCS/DG max , t P24 t=1 V Dmax, t .(14) 2.3. System Constraints Each RCS must have atleast one charging connector to supply the EVs, and Eq. (15) support this constraint. Eq. (16) and Eq. (17) are the real reactive power balance constraints, respectively in the system. Integration of RCS alters the voltage profile, so there is a need to check voltage limits in optimal planning. Eq. (18) adds the voltage limits as a constraint. Each DG has maximum and minimum capacity limits (Eq. (19)), and the maximum total capacity supplied by all DGs(PT,max DG ) is a user-defined quantity and should be less than the minimum total real power consumption throughout a day (Eq. (20)). CSi connector ≥1i= 1,2, . . . , z(numberof RCS), (15) Psub +XPdg =PD+XPRCS +Ploss,(16) Qsub +XQDG =QD+Qloss,(17) |Vmin|≤|Vn|≤|Vmax|n= 1,2, . . . , Nbus,(18) Pmin dg ≤Pa,dg ≤Pmax dg , a = 1,2, . . . , NDG,(19) NDG X a=1 Pa,DG ≤PT,max DG <min(Pn,D).(20) Here Psub and Qsub are the substation real power and reactive power respectively. PD,QD,Ploss and Qloss are real power demand, reactive power demand, real power loss and reactive power loss in a taken test system. Here RCS are considered as only real power loads, it is (PRCS) equal to CSi load.Vmin, Vmax,Pmin dg and Pmax dg are the voltage minimum limit, voltage maximum limit, DGs minimum real power limit and DGs maximum real power limit respectively. PT,max DG is the maximum limit of total active power supplied by all DGs. Pn,D real power demand at nth node of the distribution system. 3. Algorithm 3.1. Raos 3 Algorithm Rao 3 algorithm was proposed by Rao in 2020 [19]. The algorithm is easy to understand and has the advantage of metaphor-less and few algorithm-specific parameters. The principle behind this algorithm is random interaction between the candidate solutions, and the candidate solutions move towards the best solutions and away from the worst solutions in the optimization process. This algorithm is a population-based technique and updates equations in each iteration as shown below. X′ i,j,k =Xi,j,k +r1j,k(Xj,best,k − |(Xj,worst,k)|)+ +r2j,k((|Xi,j,korXr,j,k|)−(Xr,j,korXi,j,k)). (21) Here X′ i,j,k is the updated solution of ith candidate, jth variable in kth iteration. Xi,j,k is the solution of ith candidate, ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 496 POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER jth variable in kth iteration, r1,r2are random values between [0,1]. Xj,best,k is the best value of jth variable of Xin the kth iteration. Xj,worst,k is the worst value of jth variable of Xin the kth iteration. Xr,j,k randomly selected rth candidate, jth variable in kth iteration. The flowchart of the Rao 3 algorithm for optimal planning is shown in Fig. 1. Read the system data, initialize the algorithm parameters and system constants. start Initialize feasible population according to cases, evalute the fitness values. Obtain the best and worst values based on the fitness value. Set gen=1 stop Consider updated solution and discard old solution f=fnew X=Xnew Consider old solution and discard updated solution f=fold X=Xold gen=gen+1 Yes No Update the population according to RAO 3 update equation and evaluate the fitness function. If (fnew <fold) If (gen>MaxGen) Yes No Fig. 1: Flowchart for implementation of Rao 3 algorithm. Lcspop =      X1,1X1,2. . . X1,z X2,1X2,2. . . X2,z . . .. . .. . .. . . Xpop,1Xpop,2. . . Xpop,z      ,(22) Ldgpop =      Y1,1Y1,2. . . Y1,n Y2,1Y2,2. . . Y2,n . . .. . .. . .. . . Ypop,1Ypop,2. . . Ypop,n      ,(23) Sdgpop =      S1,1S1,2. . . S1,n S2,1S2,2. . . S2,n . . .. . .. . .. . . Spop,1Spop,2. . . Spop,n      .(24) Initcspop = [Lcspop]is the matrix used for optimal planning of only RCS (Case 1). This matrix consist of feasible locations of RCS in a distribution system. Initdgpop = [Ldgpop,Sdgpop]is the matrix consisting of randomly initialized feasible locations and the corresponding size of DGs used in order to plan DGs in the distribution system optimally (Case 2). Initcsdgpop = [Lcspop,Ldgpop,Sdgpop]is the matrix that consists of RCS location, DG location and the corresponding DG size. It is utilised to plan RCS and DGs at the same time to get the best results (Case 3). Here Xindicates the location of RCS, Yindicates the location of DG and S indicates the size of the DG. 3.2. Jaya Algorithm Rao proposed the Jaya algorithm [20], which is a population-based meta-heuristic algorithm. The premise of this algorithm is that the solution to an optimization problem goes towards the global best solution while avoiding the worst solution. It has the advantage that it requires only the common control parameters which are: population size and maximum iterations, and it does not require any algorithm-specific parameter setting. The modified value of kth candidate ith variable in jth iteration is obtained using the Eq. (25) given below: x′ k,i,j =xk,i,j +r1i,j (xbest,i,j −xk,i,j)+ −r2i,j(xworst,i,j −xk,i,j).(25) Here x′ k,i,j is the modified kth candidate, ith variable in jth iteration, xk,i,j is the present kth candidate, ith variable in jth iteration. r1,r2are the random values between 0 and 1 i.e. [0 1]. xbest,i,j is the best solution of ith variable among all candidates in jth iteration. xworst,i,j is the worst solution of ith variable among all candidates in jth iteration. If the objective value yield by the modified x′ k,i is better than xk,i, then the modified candidate solution is accepted in each iteration. Acceptable solutions are kept in each iteration, and subsequent searches are based on the solutions in the following iteration. When the termination criteria are met, the final optimal solutions are achieved. 4. Simulation Results and Analysis Superimposed IEEE 33 bus electrical system and 25 node road network were treated as test system [15], as shown in Fig. 2. All the buses in IEEE 33 bus test system were segregated as 17 residential load buses, ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 497 POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER 9 industrial load buses and 5 commercial load buses shown in Tab. 1. Bus data and line data were taken from [21]. The hourly load at various buses vary according to the load patterns (in p.u.) as shown in Fig. 3. The data regarding road network was taken from [22], and 1 km per unit was considered. Superimposed nodes of the distribution network and road network were taken from [15], which are represented in Tab. 3. 1 2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 26 27 28 29 30 31 32 33 23 24 25 1 7 5 15 16 12 11 17 19 18 2021 252423 22 14 10 8 4 9 3 2 6 13 7 Fig. 2: Super imposed IEEE 33 bus distribution system with 25 node road network. Time (hours) 2 4 6 8 10 12 14 16 18 20 22 24 0.2 0.4 0.6 0.8 1 1.2 Commercial load Industrial load Residential load Demand in (p.u.) Fig. 3: Plot of different types of load patterns. Tab. 1: Identification of types of load buses. Residential Commercial Industrial loads loads loads 2, 3, 5, 6 4, 11, 12, 18 22, 26, 27, 28 7, 8, 9, 10 19 29, 30, 31, 32 13, 14, 15, 16 – 33 17, 20, 21, 23, 24 – – Tab. 2: Electric vehicle technical parameters. Parameter Value Total number of EVs (NT EV ) 238 Connector rating (Rc) (kW) 96 EV battery capacity (Pb) (kWh) 50 Energy Consumption (EC) (kWh·km−1) 0.219 Electricity Price (Pe) ($·MWh−1) 87.7 The total assumed EV population at road network nodes was 238, and were allowed to charge at selected charging stations according to the probability of EV charging shown in Fig. 4. Table 4 gives the assumed number of EVs present at the nodes of the road network. In this work, all 25 road network nodes were considered demand nodes. For all optimization algorithms, 100 maximum generations and 30 population size are considered. For the PSO algorithm inertia constants C1=C2= 2 are considered. Simulations were carried out on PC with windows 10 operating system, 4 Gb ram, and MATLAB 2014b software. Tab. 3: Coupling of the road network nodes (Rn) with the distribution network nodes (Dn). DnRnDnRn 03 09 20 04 06 08 23 22 14 11 26 05 16 12 28 07 17 16 30 06 Time (hours) 0 5 10 15 20 25 0 0.02 0.04 0.06 0.08 0.1 Pevc Fig. 4: Variation of Electric Vehicle charging probability. In this paper, the analysis was done by considering the base case, case 1, case 2, and case 3. •Base case: In this case, the load flow was done on the distribution system without the integration of RCS and DG to find daily active power loss and maximum voltage deviation. •Case 1: In this case, optimal placement and sizing of RCS is done on the superimposed network to minimize the EV user cost, active power loss and voltage deviation. •Case 2: The load due to the charging stations from case 1 is added to the current load at the corresponding distribution bus in case 2. In this system, optimal placement and sizing of DGs are done to minimize the EV user cost, active power loss and voltage deviation. •Case 3: In this case, concurrent placement and sizing of RCS and DGs are done to minimize the active power loss, EV user cost and voltage deviation. ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 498 POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER Tab. 4: Assumed EVs present at road network nodes. RnEVs RnEVs RnEVs RnEVs RnEVs 1 5 6 8 11 3 16 15 21 9 2 9 7 15 12 3 17 8 22 12 3 13 8 6 13 10 18 6 23 15 4 8 9 4 14 12 19 7 24 5 5 5 10 15 15 15 20 15 25 15 4.1. Base Case The test system consists of IEEE 33 bus distribution system. As it is radial and has a high R/X ratio, the feed forward and backward sweep load flow algorithm was used for load flow study. In the base case, the distributed load flow study was simulated without the integration of RCS and DGs into the test system by considering hourly load patterns of different load types over 24 hours. It was observed that the load flow led to daily active power loss of 2811 kW and daily maximum voltage deviation of 1.5816 (p.u.). The lowest voltage of 0.8968 (p.u.) was observed at 18th node in 17th hour. Voltage profile over 24 hours is as shown in Fig. 5 Voltage (p.u.) 0.8 0.85 0.9 0.95 1 1 hour 2 hour 3 hour 4 hour 5 hour 6 hour 7 hour 8 hour 9 hour 10 hour 11 hour 12 hour 13 hour 14 hour 15 hour 16 hour 17 hour 18 hour 19 hour 20 hour 21 hour 22 hour 23 hour 24 hour Bus number 0 5 10 15 20 25 30 Fig. 5: Distribution system voltage profile in base case. 4.2. Case 1: Optimal Planning of RCS Case 1 deals with the optimal placement and sizing of RCSs. The placement was done based on the following assumptions: •The superimposed nodes are considered for RCS placement. •RCS can be placed at 3 buses and it is observed that placement at more than 3 buses makes the system unstable. In case 1, RCS was optimally planned. In optimal planning, primarily all EVs were distributed among the initialized RCS locations to minimize EV user costs by selecting the nearest RCS. After adding the RCS load, the distribution load flow algorithm is applied to the test system to find Ploss and MVD. To minimize the considered multi-objective function various algorithms are applied. It is observed from Tab. 5 that, distribution system performance is affected by RCS installation. Daily active power loss increased by 19.5 %, 12.1 %, and 9.73 % compared with the base case Ploss, obtained using PSO, JAYA, and Rao 3 algorithms, respectively. The presence of RCS is also witnessed with the increased value of MVD (1.6120 (p.u.)) in comparison with base case MVD (1.5816 (p.u.)). Here Rao 3 algorithm gave the least MVD compared to the other two algorithms. The system’s minimum voltage was 0.8949 (p.u.), which appeared at the 18th bus in the 17th hour using the Rao 3 algorithm, as shown in Fig. 6. Tab. 5: Comparison of various algorithms for optimal allocation of RCS in case 1. Parameter PSO JAYA Rao 3 CS locations 23,20,30 23,20,26 20,23,3 EVs 129,50,59 144,76,18 105,114,19 Connectors 13,5,6 14,8,2 11,11,2 Size (kW) 1248,480,576 1344,768,192 1056,1056,192 Ploss (kW) 3359.8 3151.8 3084.6 EVUC ($) 34.0335 36.1270 36.3383 MVD (p.u.) 1.6608 1.6271 1.612 APLRI 1.1952 1.1212 1.0973 EVUCI 0.3643 0.3867 0.3890 MVDRI 1.0501 1.0288 1.0193 MOF 0.8690 0.8447 0.8343 Time (sec) 250.4 169.3 155.6 Voltage (p.u.) 1 hour 2 hour 3 hour 4 hour 5 hour 6 hour 7 hour 8 hour 9 hour 10 hour 11 hour 12 hour 13 hour 14 hour 15 hour 16 hour 17 hour 18 hour 19 hour 20 hour 21 hour 22 hour 23 hour 24 hour Bus number 0.8 0.85 0.9 0.95 1 0 5 10 15 20 25 30 Fig. 6: Distribution system voltage profile in case 1. RCS placement caused, the downfall of system minimum voltage from 0.8968 (p.u., base case) to 0.8949 (p.u.). EVUC is 36.3383 $ with Rao 3 algorithm which is high among EVUC of PSO and JAYA algorithms. However, the overall objective function value of 0.8343 ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 499 POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER by the Rao 3 algorithm is the lowest in comparison with the JAYA algorithm (0.8447) and PSO algorithm (0.8690). Rao 3 algorithm took less time for evolution compared to PSO and JAYA algorithms. To counter the effects caused by RCS installation in the distribution system DGs are installed. 4.3. Case 2: Optimal Planning of DGs Installing DGs in the distribution system reduces power loss and improves voltage profile. Renewable type DGs of size 5 kW–1 MW are considered for integration. It has been observed that integration of three DGs in a distribution system outperforms integration of single DG or two DGs. It’s also been observed that adding more than three DGs to a distribution system doesn’t significantly increase performance. As a result, three DGs were considered in this study. The hourly total real load demand on the system, which includes RCS load and the hourly charging probability of EVs, is depicted in Fig. 7. According to this plot, the minimum real power load demand of 1420.8 kW appeared at the 4th hour. As a result, the total real power injection by all DGs is limited to less than or equal to 1400 kW (<1420.8) according to the constraint Eq. (20). Time (hours) 0 5 10 15 20 0 1000 2000 3000 4000 5000 6000 With out RCS load With RCS load Real Power Demand (kW) Fig. 7: Plot of hourly varying load demand with and with out RCS load. Tab. 6 shows the optimal placements, DG sizes, and numerous technical observations. When compared to the base case, active power loss was reduced to 38.42 % in case 2. This reduction was aided by the insertion of DGs in the distribution system. The PSO and JAYA algorithms reduced active power loss by 40.06 % and 39.45 %, respectively, but the optimal placements and sizes of DGs obtained by the Rao 3 algorithm reduced active power loss to the maximum in comparison with the other two algorithms. The maximum voltage deviation with the Rao 3 algorithm was 0.5215 (p.u.), which is higher than the 0.5151 (p.u.), 0.5162 (p.u.) of the PSO, and JAYA algorithms, respectively. Furthermore, as compared to 0.3718 of PSO and 0.3699 of JAYA, the Multi-Objective Function (MOF ) with the Rao 3 algorithm was 0.3675, which was the lowest value. The voltage profile at all buses throughout the day is depicted in Fig. 8, with the DGs placed at optimal locations and sizes using the Rao 3 algorithm. A minimum voltage of 0.9626 (p.u.) appeared at the 30th bus in the 19th hour, according to Fig. 8. The lowest voltage at the 18th bus improved from 0.8968 (p.u. base case) to 0.9627 in the 17th hour (p.u.). The placement of DGs in the proper locations is responsible for this improvement. When compared to the PSO and JAYA algorithms, Rao 3 produced efficient outcomes in the shortest time. Tab. 6: Comparison of various algorithms for optimal allocation of DGs in case 2. Parameter PSO JAYA Rao 3 DGs locations 15,33,5 33,15,8 33,15,12 Size (kW) 609,784,5 793,554,52 773,429,196 Ploss (kW) 1126.3 1108.9 1080 EVUC ($) 36.3383 36.3383 36.3383 MVD (p.u.) 0.5151 0.5162 0.5215 APLRI 0.4007 0.3945 0.3841 EVUCI 0.3890 0.3890 0.3890 MVDRI 0.3257 0.3264 0.3297 MOF 0.3718 0.3699 0.3675 Time (sec) 274.2 136.1 130.5 4.4. Case 3: Concurrent Optimal Planning of RCS and DGs In this case, the Rao 3 algorithm was used to plan RCS and DGs at the same time. RCS location, DG location, and DG size make up the initialization matrix. The system was examined for improved overall objective function once these two were added. Tab. 7 shows the optimal results by the various algorithms. The Rao 3 algorithm was shown to generate a better MOF of 0.3441. The daily active power loss was 1079.2 kW, or 38.39 % of the base active power loss. In comparison to the PSO and JAYA algorithms, the Maximum Voltage Deviation (MVD) was 0.5960 (p.u.), which was the lowest of the values. With the Rao 3 algorithm, EV user cost of an electric vehicles was 25.3715 $, which is cost - effective when compared to the 42.3306 $ and 31.1142 $ for PSO and JAYA, respectively. The system’s voltage profile is shown in Fig. 9, with the RCS and DGs placed simultaneously using the Rao 3 algorithm. At 16th bus in 20th hour, the system’s minimum voltage is 0.9518 (p.u.). The voltage improved from 0.8968 (p.u., base case) to 0.9629 (p.u.) at the 18th bus in the 17th hour. When compared to the other two algorithms, the Rao 3 algorithm takes less time to simulate and produce optimal results. ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 500 POWER ENGINEERING AND ELECTRICAL ENGINEERING VOLUME: 20 |NUMBER: 4 |2022 |DECEMBER We know from Tab. 8 that, daily active power loss is gradually reduced from case 1 to case 3. Though the maximum voltage deviation is slightly higher in case 3 compared to case 2, EVUC and overall objective function are the smallest of all cases (case 1 and case 2) in case 3. Based on these findings, it can be inferred that using the Rao 3 algorithm to plan RCS and DGs concurrently (case 3) generated the best outcomes. Tab. 7: Comparison of various algorithms for concurrent optimal allocation RCS and DGs in case 3. Parameter PSO JAYA Rao 3 CS locations 20,28,16 23,20,6 16,20,23 EVs 44,112,82 104,40,94 67,73,98 Connectors 4,11,8 10,4,9 7,7,10 Size (kW) 384,1056,768 960,384,864 672,672,960 DGs locations 13,11,30 14,31,30 31,11,17 Size(kW) 514,69,791 569,461,151 615,389,395 Ploss (kW) 1271.9 1219.2 1079.2 EVUC ($) 42.3306 31.1142 25.3715 MVD (p.u.) 0.8192 0.6714 0.5960 APLRI 0.4525 0.4337 0.3839 EVUCI 0.4531 0.3331 0.2716 MVDRI 0.5179 0.4245 0.3768 MOF 0.4745 0.3971 0.3441 Time (sec) 298.8 160.1 148.06 1 hour 2 hour 3 hour 4 hour 5 hour 6 hour 7 hour 8 hour 9 hour 10 hour 11 hour 12 hour 13 hour 14 hour 15 hour 16 hour 17 hour 18 hour 19 hour 20 hour 21 hour 22 hour 23 hour 24 hour Bus number 0.9 0.92 0.94 0.96 0.98 1 1.02 0 5 10 15 20 25 30 Voltage (p.u.) Fig. 8: Distribution system voltage profile in case 2. Bus number 0 5 10 15 20 25 30 1 hour 2 hour 3 hour 4 hour 5 hour 6 hour 7 hour 8 hour 9 hour 10 hour 11 hour 12 hour 13 hour 14 hour 15 hour 16 hour 17 hour 18 hour 19 hour 20 hour 21 hour 22 hour 23 hour 24 hour 0.9 0.92 0.94 0.96 0.98 1 1.02 Voltage (p.u.) Fig. 9: Distribution system voltage profile in case 3. Iterations 0 10 20 30 40 50 60 70 80 90 100 0.84 0.86 0.88 0.9 0.92 PSO JAYA RAO3 MOF Fig. 10: Convergence characteristics by various algorithms in case 1. Tab. 8: Comparison of Ploss, MVD, and EVUC in various cases by Rao 3 algorithm. Parameter Base case Case 1 Case 2 Case 3 Ploss (kW) 2811 3084.2 1080 1079.3 MVD (p.u.) 1.5816 1.6120 0.5215 0.5960 EVUC ($) – 36.3383 36.3383 25.3715 MOF – 0.8343 0.3675 0.3441 Iterations 0 10 20 30 40 50 60 70 80 90 100 0.4 0.45 0.5 PSO JAYA RAO3 MOF Fig. 11: Convergence characteristics by various algorithms in case 2. 100 Iterations 0 10 20 30 40 50 60 70 80 90 0.35 0.4 0.45 0.5 JAYA RAO3 PSO MOF Fig. 12: Convergence characteristics by various algorithms in case 3. 5. Conclusion Adopting electric vehicles for road transport is a feasible way to reduce greenhouse gas emissions. Although, RCS promotes EV sales, it can harm the distribution ©2022 ADVANCES IN ELECTRICAL AND ELECTRONIC ENGINEERING 501