Research article · Aug 2014
Research articlePublished Apr 2014
Black Out Recovery in Transmission Network Using Greedy Algorithm
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
A graph theory based methodology called dijkstra’s algorithm is used to find the energizing path of power to flow for a given network after a complete blackout is proposed here. Whenever a blackout occurs in the transmission network, the power system operators are under immense pressure to restore the network.The main aim of the power system restoration is to restore as much load as possible & as quickly as possible. After a blackout occurs first all the generators has to be energized and then synchronized. After synchronization of generators only all the loads can be supplied. For energizing the generators a sequential procedure has to be followed. If the sequence used is wrong then it may lead to cascaded outages.The Dijkstra's algorithm helps in finding the sequence to energize the generators based on least impedance path called minimum spanning tree. Newton Raphson based load flow technique is applied to this resultant minimum spanning tree(power flow path). Based on the results (voltage, current and power flow) obtained from the load flow solutions, other constraints of the restoration problem are applied.
Subjects
EngineeringAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · May 2013
Minimize the end to end delay and Maximize the coverage of Wireless sensor nodes using Data Fusion Distributed Truncated Greedy algorithm
Research article · Apr 2014
An Efficient Adaptive Layer Switching Algorithm for Video Transmission over Link- Adaptive Networks
Research article · Jul 2013
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Research article · Aug 2014
LGDSTR: Local Greedy Distributed Spanning Tree Routing by Reducing Local minima in higher dimensional space
More from this journal
The newest in International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering.
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering
- SubjectEngineering
- BylineArticles whose byline prints “Naveen.G”
- BylineArticles whose byline prints “Arther Jain .A”
