Real power loss reduction by arctic char algorithm

Received Jan 3, 2020 Revised Mar 4, 2020 Accepted Jun 8, 2020 This work presents Arctic Char Algorithm (ACA) for solving optimal reactive power problem. In North America movement of Arctic char phenomenon is one among the twelve-monthly innate actions. Deeds of Arctic char have been imitated to design the algorithm. In stochastic mode solutions are initialized with one segment on every side of to the route ascendancy; particularly in between lower bound and upper bounds. Previous to the movement, Arctic char come to a decision about the passageway based on their perception. This implies stochastic mix up of control parameters to push the Arctic char groups (preliminary solution) in mutual pathway (evolutionary operators). Projected Arctic Char Algorithm (ACA) has been tested in standard IEEE 14,300 bus test system and simulation results show the projected algorithm reduced the real power loss extensively.


INTRODUCTION
Reactive power problem plays a key role in secure and economic operations of power system. Optimal reactive power problem has been solved by variety of types of methods [1][2][3][4][5][6]. Nevertheless, numerous scientific difficulties are found while solving problem due to an assortment of constraints. Evolutionary techniques [7][8][9][10][11][12][13][14][15][16] are applied to solve the reactive power problem, but the main problem is many algorithms get stuck in local optimal solution & failed to balance the Exploration & Exploitation during the search of global solution. This work presents Arctic Char Algorithm (ACA) for solving optimal reactive power problem. In North America movement of Arctic char phenomenon is one among the twelvemonthly innate actions. Through mountain streams millions of Arctic chars will move for spawning. During the movement starving bears, human fishers and waterfalls are generally significant threats they have to face. In this work deed of Arctic char has been imitated to design the algorithm. In stochastic mode solutions are initialized with one segment on every side of to the route ascendancy; particularly in between lower bound and upper bounds. Projected Arctic Char Algorithm (ACA) has been tested in standard IEEE 14,300 bus test system and simulation results show the projected algorithm reduced the real power loss extensively.

PROBLEM FORMULATION
Objective of the problem is to reduce the true power loss: Voltage deviation given as follows: Voltage deviation given by: Constraints (Inequality) ≤ ≤ , ∈ ≤ ≤ , ∈ Q c min ≤ Q c ≤ Q C max , i ∈ N C (9)

ARCTIC CHAR ALGORITHM
In North America movement of Arctic char phenomenon is one among the twelve-monthly innate actions. Through mountain streams millions of Arctic chars will move for spawning. During the movement starving bears, human fishers and waterfalls are generally significant threats they have to face. In this work deed of Arctic char has been imitated to design the algorithm.
In stochastic mode solutions are initialized with one segment on every side of to the route ascendancy; particularly in between lower bound and upper bounds. Solutions are initialized arbitrary mode with reverence to the solution space.
Previous to the movement, Arctic char come to a decision about the passageway based on their perception. This implies stochastic mix up of control parameters to push the Arctic char groups (preliminary solution) in mutual pathway (evolutionary operators).
Where 1 is the total number of Arctic char groups which pass through ocean and ponds, 2 is the total number of Arctic char group transit through forest area and mountain valley, is the total number of Arctic char groups which partake in the relocation and is Distribution factor is symbolizes the Arctic char intuition.
Crossing of ocean, lakes and ponds has been scientifically modeled as, Where t symbolizes the present iteration number, symbolize a new-fangled perceive region (fresh solution) and shows the previous area of the explore convey (preceding solution). ( , ) is computed by, Where T indicates maximum number of iterations, b is an arbitrary number normally larger than value 1 Chief hunters discover the regions with a satisfactory Arctic char concentration (solution fitness). Subsequent to that, they notify the engaged agent to make use of close by area to discover additional concentrated regions (solution with elevated fitness). This operation has been precisely defined by, Where β is a arbitrary number which span from 0 and 1 with consistent distribution, YR stand for the freshly spotted solution by the engaged agent, YM1 is the solution acquired by the primary key hunter and YM2 is the solution acquired by the subsequent one.
Second operator simulates the bears hunt line of assault. Naturally they notify each other when they find an appropriate region. When they discover a region with superior Arctic char concentration, they notify to other bears. It expressed as, Where YB symbolizes the new-fangled spotted area, BTR is the most excellent accounted area by the hunting squad, CLR is the present area for which the bears have determined to execute the local exploitation and φ is a capricious angle with a segment on every side of 0 to 360 degrees. cos (φ) articulate the bears to their objective.
End of the repositioning, stay alive Arctic char will get together in their mark for spawning. In Arctic char this normal event is replicated through a compilation stem. After Arctic char surpass through their passageway (operator's performance), the Arctic char subgroups (solutions) are composed in a exclusive stem. Solutions are extorted from mutual operators and make an exclusive population. At this condition, the proposed algorithm has reached the ending stage of the primary iteration.
Step1. Determine the population size, solution space, total number of variables, iterations Step2. Regulate the Arctic char subgroups chaotically Step3. Depending on migration passageway is chosen Step4.Compute the fitness of hunted Arctic char Step5. Arctic char used for spawn has been rumple together Step6. If yes obtain the global solution or else go to step number 3.

SIMULATION RESULTS
At first in standard IEEE 14 bus system the validity of the proposed Arctic Char Algorithm (ACA) has been tested & comparison results are presented in Table 1. Then IEEE 300 bus system [18] is used as test system to validate the performance of the Arctic Char Algorithm (ACA). Table 2 shows the comparison of real power loss obtained after optimization.

CONCLUSION
In this work Arctic Char Algorithm (ACA) successfully solved the optimal reactive power problem. Deeds of Arctic char have been imitated to design the algorithm. End of the repositioning, stay alive Arctic char will get together in their mark for spawning. In Arctic char this normal event is replicated through a compilation stem. After Arctic char surpass through their passageway (operator's performance), the Arctic char subgroups (solutions) are composed in a exclusive stem. Solutions are extorted from mutual operators and make an exclusive population. Projected Arctic Char Algorithm (ACA) has been tested in standard IEEE 14,300 bus test system and simulation results show the projected algorithm reduced the real power loss extensively.