transmission shortest path using cuckoo search algorithm ... · transmission shortest path using...
Post on 02-Apr-2020
43 Views
Preview:
TRANSCRIPT
Transmission shortest path using cuckoo search
algorithm considering Black-start generators
R Hariharan1, Dr.P.Usha Rani2 Ravi Raju. A
[3], HM. Panchaksharaiah Swamy
[2] 1Resarch Scholar, Department of Electrical & Electronics, Saveetha School of Engineering,
Saveetha Institute of Medical and Technical Sciences, Chennai, India, harinov22@gmail.com. 2 Professor, Department of Electrical & Electronic, R.M.D Engineering College, Chennai, India,
pusharani71@yahoo.com 3,4U.G. Scholar, Department of Electrical and Electronics Engineering, Saveetha School of
Engineering, Saveetha Institute of Medical And Technical Science, Chennai 1
Abstract
Power system restoration process is a tedious process in power system. It takes maximum
time to restore the system. It is a complex process, it having many steps to restore the system as
generator start-up, network reconfiguration and load pickup. This paper proposed to find the
shortest transmission path for activate the NBS unit and Load using Cuckoo search algorithm for
fast restoration process. This algorithm tested in IEEE 14 bus system by Virtual instrumentation.
Result shows the path information and weight index value with all the constraints are satisfied.
Keywords: BS Unit, NBS Unit, Transmission shortest path, Blackout Restoration
1. Introduction
Blackout is long-term shortage in power system. It’s happened due to system (equipment)
failure, natural disaster, and unbalance generation demand power and constraints violation.
International Journal of Pure and Applied MathematicsVolume 119 No. 12 2018, 15945-15956ISSN: 1314-3395 (on-line version)url: http://www.ijpam.euSpecial Issue ijpam.eu
15945
Blackout restoration process is a complex process in the power system. Many strategies are using
to restore the system effectively. But still it was having so many flops in the process.
[1],[3],[4]Blackout restorations having the following steps are [15] Generator star-up strategy,
network reconfiguration and load pickup. After sectionalized the power system by Subsystem as
an island, then it restores the system parallel manner. Then all the subsystem synchronizes
together with all the constraints are satisfied. In Network reconfiguration to find the path to start
the Non-Black start unit generator and Pick-up the critical load [14]. [10]Many shortest path
algorithms are used as dijikstars algorithm [13], graph theory [12], [16] and OBDD [11] method
is used to restore the system.
Finding the transmission shortest path from one node to another node is the important
task in the power system restoration process for pick upload or start up the NBS unit. So many
algorithms are followed for to find the shortest path algorithm but it takes much computation
time. Here proposing cuckoo search algorithm for to find the transmission shortest path with all
the constraints are satisfied.
[9]Cuckoo is interesting winged creatures, not just on account of the lovely sounds they
can make, yet additionally in view of their forceful generation methodology. A few animal
categories, for example, the aniand Guiracuckoos lay their eggs in mutual homes, in spite of the
fact that they may expel others' eggs to build the bring forth likelihood of their own eggs [12]. A
significant number of animal types connect with the commit brood parasitism by laying their
eggs in the homes of other host winged animals (frequently different species). There are three
fundamental sorts of brood parasitism: intraspecific brood parasitism, agreeable rearing, and
home takeover. Some host flying creatures can draw in coordinate clash with the barging in
cuckoos. In the event that a host fowl finds the eggs are not their possesses, they will either
discard these outsider eggs or essentially surrender its home and construct another home
somewhere else. Some cuckoo species, for example, the New World brood-parasiticTaperahave
advanced in such a way that female parasitic cuckoos are frequently extremely represented
considerable authority in the mimicry in shading and example of the eggs of a couple of picked
have species . This decreases the likelihood of their eggs being relinquished and in this way
expands their reproductively. What's more, the planning of egg-laying of a few animal types is
too astonishing. Parasitic cuckoos frequently pick a home where the host feathered creature
simply laid its own particular eggs. As a rule, the cuckoo eggs incubate marginally sooner than
their host eggs. Once the principal cuckoo chick is brought forth, the main intuition move it will
make is to remove the have eggs by indiscriminately moving the eggs out of the home, which
builds the cuckoo chick's offer of sustenance, gave by its host feathered creature. Concentrates
likewise demonstrate that a cuckoo chick can likewise mirror the call of host chicks to access all
the more encouraging open door.
International Journal of Pure and Applied Mathematics Special Issue
15946
2. OBJECTIVE FUNCTION
Find the shortest path between two bus-bars with minimum number of CB Operation with the
constraints is satisfied.
2.1 PROBLEM CONSTRAINTS
Pg > (Pick up Load)
3. RECOMMENDED SYSTEM
A new optimization algorithm, called Cuckoo Search (CS), was developed recently by Yang and
Deb (2009). The optimal solutions obtained by CS are far better than the best solutions obtained
by an efficient particle swarm optimizer. Proposed method will discuss the unique search
features used in CS and the implications for further research. Here cuckoo algorithm correct
shortest path from one node to another node. In cuckoo search algorithm check all the constraint
from all the combination path will calculate. Shortest path got selected.
This methodology is tested in IEEE 14 bus system by virtual instrumentation. Virtual
instrumentation IEEE 14 bus system busbar and line are representing by indicator. VI collect the
data from the IEEE 14 bus system. Depends upon the input it will identify the shortest path from
one node to another node with all the constraints are satisfied. Shortest path identified interim of
weight index value.
International Journal of Pure and Applied Mathematics Special Issue
15947
Figure 1: Complete restoration strategy
Generation capability optimization
Transmissio n restrotoin
Distribution
restoration
Synchronization
Shortest path
algorithm by VI
International Journal of Pure and Applied Mathematics Special Issue
15948
Figure 2 : Flow chart for Proposed system
Start
Obtain the Input information for
Starting node and Ending node ( Pg,
Pd,)
Depends upon the input it select the case in case structure loop in
Virtual instrumentation.
Set iter = 0 & initialize no of
intermax
Initialize the parameters, population of host nests, Dimension of each host nest &
Fraction of Worse nest
Rank the results and determine the best nest position (shortest path) and save its
solution for optimal solution.
Iter = Iter +1
Get a cuckoo by random walk from levy flight operation
result in new nests
Calculate objective function value for every new Position
(shortest path)
Get a cuckoo by random walk from levy flight operation result in new nests
& determine best nest, (best solution) among the initial nest.
Calculate objective function value for each new nest positions (New
Shortest path from one node to another with all the constraints
satisfied ).
Check the
stopping
criteria if iter =
iterMax
Yes
No
Print optimal solution Stop
International Journal of Pure and Applied Mathematics Special Issue
15949
4. STEPS TO BE FOLLOWED FOR OPTIMIZATION
Step 1: Energize the Network topology
Step 2: Obtain the Circuit breaker status, Starting Busbar and Ending Busbar.
Step 3: Select the higher priority shortest path from one node to other node.
Step 4: Set the lower and upper limits for the constraints.
Step 5: Initiate random population of n host nests, iX for the circuit breaker status and total
binary weight of the path.
Step 6: Obtain cuckoo randomly using Levy flights, i
Step 7: Evaluate its fitness ( iF ) according to objective function.
Step 8: Get a nest randomly from population j.
Step 9: If ji FF , then go to step 11. If no go to step 12.
Step 10: Let j as the solution.
Step 11: Replace j as the new solution.
Step 12: If a fraction of nest is replaced by new nests then create a new nest at new location with
the help Levy flights.
Step 13: Choosing the best current nests.
Step 14: Allow the current best solution to the next generation.
Step 15: If maximum iteration is not reached then go to step 6, otherwise it is the best nest
(optimal solution).
Step 16: Display optimal solution.
5. Front panel and block diagram window for virtual instrumentation
Graphical coding is built in block diagram window in virtual instrumentation using
tools[18 -22]. In the window case loop structure tool is used to select the cases, depends upon the
case structure it produce the feasible output. Which case is satisfied that condition only
processed and other all the cases are idle mode. All the combination will compare then it choose
the feasible case by using cuckoo search algorithm. In block diagram comparator, arithmetic and
logical palette tool are used to build the proposed system.
Front panel of the system is user interface window. User can easily access the system
variation by virtual manner. Indicator tool are used in front panel for showing the results.
International Journal of Pure and Applied Mathematics Special Issue
15950
Figure 3: Block diagram Virtual instrumentation window of proposed system
Figure 4: Front panel Virtual instrumentation window of proposed system
International Journal of Pure and Applied Mathematics Special Issue
15951
6. Simulation result and discussion
Cuckoo search algorithm is used to find the shortest transmission path it’s tested in IEEE
14 bus system using virtual instrumentation with G coding. Initialize the population size,
constraint priority level in virtual instrumentation. Depend upon the input of the system state it
compute automatically is shows the fitness solution quickly. In front panel whatever variation to
apply in the bus, the system response quickly with the fitness solution.
In IEEE 14 bus system having 5 generators in that G0 is consider Black-start generator
and other all the generators are Non Black-start generators. In the front panel having Generator
black start unit control tool will select the NBS going to get cranking power from BS unit.
Depend upon the cuckoo search algorithm show the path by string indicator and weight of the
path.
In Figure1 shows G0 providing power to G1. At that period all the circuit breaker on close
condition so it select short path P12 and weight of the path is 1. In figure 2 (P1-P2) circuit
breaker is open so cuckoo search algorithm again computed. it show the next shortest path is
(P1-P5-P2) and weight of the path is 2.
Figure 5 : Shortest path as ( P1 –P2)
International Journal of Pure and Applied Mathematics Special Issue
15952
Figure 6: Shortest path as ( P1 –P5 – P2)
Table 1 shows the combination of the shortest path from one node to another node and weight
Number of path, these are the conditions is include in the cuckoo search algorithm to find the
fitness solution.
TABLE 1: Possible combination on Transmission path for each BS unit to NBS unit in IEEE 14
bus Systems.
S.NO NBS BS Transmission path Weight/Number of
path
1 G0 G1 P12 1
P15-P52 2
P15-P54-P42 3
P15-P54-P43-P32 4
2 G0 G2 P15-P52-P23 4
P15-P54-P43 4
3 G0 G3 P15-P56 3
International Journal of Pure and Applied Mathematics Special Issue
15953
P12-P24-P49-P910-P1011-P116 7
P12-P24-P49-P914-P1413-P136 7
4 G0 G4 P15-P54-P47-P78 4
P12-P24-P47-P78 4
P15-P56-P611-P1110-P109-P97-P78 7
Conclusion and Future scope
Cuckoo search algorithm was implementing in IEEE 16 bus system for to find the
shortest transmission path with all the constraints are satisfy. This result shows the fastest
response after providing population and system data. It will automatically compute the system
then it produces the output. So the Power system restoration process runs at effective manner. In
future this proposed system implemented in complex system with hardware implementation.
Reference
[1] Zhang, C., Lin, Z., Wen, F., Ledwich, G., & Xue, Y. (2014). Two-stage power network
reconfiguration strategy considering node importance and restored generation capacity. IET
Generation, Transmission & Distribution, 8(1), 91-103.
[2] Hou, Y., Liu, C. C., Sun, K., Zhang, P., Liu, S., & Mizumura, D. (2011, July). Computation
of milestones for decision support during system restoration. In Power and Energy Society
General Meeting, 2011 IEEE (pp. 1-10). IEEE.
[3] Sun, W., Liu, C. C., & Zhang, L. (2011). Optimal generator start-up strategy for bulk power
system restoration. IEEE Transactions on Power Systems, 26(3), 1357-1366.
[4] Gu, X., & Zhong, H. (2012). Optimization of network reconfiguration based on a two-layer
unit-restarting framework for power system restoration. IET generation, transmission &
distribution, 6(7), 693-700.
[5] Liu, Y., Sun, P., & Wang, C. (2015). Group decision support system for backbone-network
reconfiguration. International Journal of Electrical Power & Energy Systems, 71, 391-402.
[6] Shi, L., Ding, H. L., & Xu, Z. (2012). Determination of weight coefficient for power system
restoration. IEEE Transactions on Power Systems, 27(2), 1140-1141.
[7] Wang, C., Vittal, V., Kolluri, V. S., & Mandal, S. (2010). PTDF-based automatic restoration
path selection. IEEE Transactions on Power Systems, 25(3), 1686-1695.
[8] Yuan, R., Ling, J., Zhang, Z., Ruan, Y., & Sheng, Y. (2010, July). A genetic algorithm
method for standing phase angle reduction in power system restoration. In Power and Energy
Society General Meeting, 2010 IEEE (pp. 1-6). IEEE.
[9] Yang, X. S., & Deb, S. (2014). Cuckoo search: recent advances and applications. Neural
Computing and Applications, 24(1), 169-174.
International Journal of Pure and Applied Mathematics Special Issue
15954
[10] Gajbhiye, S. (2013). Optimal Power Flow Path Selection Using Different Shortest Path
Algorithms. International Journal of Innovations in Engineering and Technology (IJIET), 2(1),
2319-1058
[11] Wang, C., Vittal, V., & Sun, K. (2011). OBDD-based sectionalizing strategies for parallel
power system restoration. IEEE Transactions on Power Systems, 26(3), 1426-1433.
[12] Quirós-Tortós, J., & Terzija, V. (2013, June). A graph theory based new approach for
power system restoration. In PowerTech (POWERTECH), 2013 IEEE Grenoble (pp. 1-6). IEEE.
[13] Dr. Afaneen A. Alkhazraji and Sammar J. Ismail Restoring the Iraqi Transmission Network
using k-Shortest Path Algorithms, ISSN: 1995-0772, EISSN: 1998-1090, 2017 April 11(4):pages
146-158,AENSI Publication
[14] Hariharan, R., and P. Usha Rani. "A Complete restoration methodology using virtual
instrumentation." Int J of Control Theory Appl 9.2 (2016): 681-686.
[15] Hariharan, R., and P. Usha Rani. "Blackout restoration process by PHEV charging station
integrated system using virtual instrumentation." Signal Processing, Communication and
Networking (ICSCN), 2017 Fourth International Conference on. IEEE, 2017.
[16] Hariharan, R. "Design of controlling the smart meter to equalize the power and demand
based on virtual instrumentation." Power, Energy and Control (ICPEC), 2013 International
Conference on. lIEEE, 2013.
[17] Saikiran, B., and R. Hariharan. "Review of methods of power theft in Power
System." International Journal of Scientific & Engineering Research 5.11 (2014): 276-280.
[18] Hariharan, R., and P. Usha Rani. "Graph theory based power system restoration using
LabVIEW." ARPN J Eng Appl Sci. ISSN 6608 (1819)
[19] Hariharan, R. "Design of controlling the charging station of PHEV system based on virtual
instrumentation." (2012): 43-46.
[20] Hariharan, R., P. Usha Rani, and P. Muthu Kannan. "Sustain the Critical Load in Blackout
Using Virtual Instrumentation." Intelligent and Efficient Electrical Systems. Springer, Singapore,
2018. 77-88.
[21] Hariharan, R., and P. Usha Rani. "Optimal Generation Start-Up strategy for Blackout
Restoration Using Virtual Instrumentation." Indian Journal of Public Health Research &
Development 8.4 (2017).
[22] Sowmiya, N., P. Nandhini Devi, and R. Hariharan. "Review on Challenges Facing on
Smartd grid Overcome by Intelligence System." Indian Journal of Public Health Research &
Development 8.4 (2017): 1111-1117.
[23] Nethaji Kumar D, 2 L.Bharathi, 3 R Mahadevan POLYNOMIAL TIME ROUTING ALGORITHM TO
IDENTIFY SHORTEST PATH IN A DISTRIBUTED WIRELESS NETWORKS International Journal of
Innovations in Scientific and Engineering Research (IJISER)
International Journal of Pure and Applied Mathematics Special Issue
15955
15956
top related