This action might not be possible to undo. Are you sure you want to continue?

SHORTEST PATH COMPUTATION IN A TRANSMISSION LINE NETWORK

ABSTRACT

In this paper a generalized algorithm has been developed to find the shortest path in a transmission line network. The selected network or graph for the proposed algorithm has the ability to traverse a network or graph with any complex structures, with any number of nodes and with any number of paths this algorithm has been developed by considering the source node as the starting node and designation node as the end node.

Dijikstras¶s algorithm is used to find the closest node from the source node. The proposed software is developed, tested and verified with an example. The problem of finding efficient routing algorithm has been a fundamental area, in the field of a transmission line network. Routing is the act of transform the power from source to destination.

INTRODUCTION

Routing in network involves two basic activities y y Determining optimal routing paths and Transporting power from through an inter network.

An ideal routing algorithm should strive to find the optimal path for power transmission within a least transmission cost so as to satisfy the customers demand for a fast service.

AVAILABLE VOLTAGE LEVELS IN KV AC HVDC India 66 110 132 220 400 500 800 Other countries 66 275 370 735 1000 1100 600 CONSTRUCTION ACTIVITIES Survey Design manufactures Laying of foundation Erecting of superstructures .The optimality attributes which usually implies an efficient use of the network resources so as to optimize a selected performance measures such as network through put. This paper focuses on the minimum short path routing where the goal is to minimize the weight of the traveling path and reduces the investment cost on transmission line. CONSTRUCTION OF TRANSMISSION LINES: Transfer of bulk power from the generating station/substation to the load centers. safe and reliable power supply. Power transmission at higher voltage and reduced current for the same quantum of energy there by reducing the line loss (I2R) Efficient.

STRUCTERS Mild steel Mild steel + High tensile steel Vertical Horizontal Delta SHAPES CROSSINGS River crossing Railway crossing Road crossing Power line crossing Communication line crossing Aerodromes Radar centers . FACTORS INFLUENCING THE TOWER Voltage level Limitation of row Audio and interference Electrostatic fields TYPES OF TOWERS Broad Based Narrow Based Square Base Rectangular Base Y or V shaped supported by external and internal guys. Stringing of conductors Commissioning TOWER This is the most important items to support the power conductor and ground wires at the required distance above ground level maintaining an appropriate inter conductor spacing in all operating condition. This constitutes about 30 to 40% of the cost of the line.

Right direction in which future load is anticipated. toposheet map of the area which indicate town roads. play grounds. river shills. like stapes. Angle points should be less. required working equipped with tools and tackles should be available as when required. Rifle ranges (Military target areas) Helipads LINE PLANNING The basic parameters for selection of material and standards. gardens. AVOIDING THE FOLLOWING AREA Restricted and difficult country side Urban development area Restricted access for transport vehicles Abrupt changes in route Wide river and railway crossing Property to aerodromes Natural hazards. once decided will help adopting sound construction practices estimation of material labour and transports facilities should have been assessed. valleys. railway lines may be collected and the proposed line should be marked on it before finalizing the route the following parameters should be kept in mind. The shortest route practicable As closed as possible to the road for easy during the construction and maintenance. The material should be made available at site. forest. MINIMUM LAND WIDTH REQUIRED FOR POWER LINE CONSTRUCTION. SURVEY OF THE PROPOSED ROUTE OF LINE The first step to be taken prior to the design or construction of any line is to conduct proper survey of the area which the line is to be passed. streams. 11KV 33KV 66KV 7 meters 15 meters 18 meters . lakes. hills.

there may be several paths in a net work. This is the normal procedure for finding the shortest path or minimum path of a transmission network or graph. that too the minimum lengths? The solution for the above question has not been answered yet.This procedure is a precise one which exact shortest path of a given graph and also gives the solution for the question discussed above and is completely different from Dijikstra¶s and Wars hall¶s algorithm. For instance Dijikstra¶s algorithm computes the shortest path from the source node to every other node in the network. Starting from the source node to the destination node. DESCRIPTION OF THE PROPOSED SYSTEM The proposed gives an exact solution for the question that has been asked below. Now the path having the minimum length among all the paths from source to destination will be regarded as the minimum path of the network. Similarly Wars Hal¶s algorithm computes the shortest path from the source node to destination node of a given network. where the network or graph. The lengths of a each path are taken in to consideration and they are compared with each other respectively. What will be the minimum path if two or more paths have the same length of a given graph? (all those paths having the minimum length). Several algorithms have been discovered so far to compute the short path in a graph.110KV 132KV 220KV 400KV 22meters 27 meters 35 meters 52 meters PROBLEM STATEMENT The main objective of the proposed algorithm is to find the minimum path in a transmission line network. . All this algorithms described so far. where network or the graph has exactly only one minimum path here question arises. But the proposed algorithm gives a precise solution for the question discussed above. What will be the minimum path if a network or graph has more than two paths having the same length (eight). find the minimum path of a communication network or a graph.

If two or more paths have the same length. But this paper gives a perfect solution for the above query. Finally the corresponding path of the first element is considered to be the shortest path of the given graph G with N vertices. PATH COMPUTATION ALGORTHIM 1. The source node and the destination node are noted 3.even now if two paths has the sane number of edges and same weight then both the paths are the shortest paths from the source node to the destination node of the given graph. The number of edges of these paths is noted. 4.Dijikstra¶s has analyzed the various paths from source to destination and has given the minimum path among the N given paths as the shortest path of the graph. . 11. The lengths of each path are found out by adding the weight of each edge in as separable variable. The paths are also sorted simultaneously using the string comparison functions.the second step is to find the length path has been found out . 12. The first element in the array will have the path with the minimum number of edges. Now the first element in the array will have the minimum length 7. Let us consider a graph or a network G with N vertices (nodes)and P paths. irst the various paths from the source node to the destination node are taken not consideration. then the paths having the same minimum lengths are sorted in a separate array 9. The number of paths and the number edges of each path are got in the run of time of the current program. 10. The number of vertices of the given Graph N is noted 2. 8. 5. 6. If two or more paths have the minimum length then the paths having the minimum lengths ate taken into consideration separately. By using the exchange sort procedure the lengths of each path has been sorted and store in a separate array.Warshall has traversed the entire graph from the beginning to end and has given the minimum path from the Oth vertices to the Nth vertices. The numbers of edges of each path are got in run time of the program and the total numbers of edges of each path are stored in a separate array. the path having the minimum lengths will be the shortest path of the given graph . that too the minimum lengths. These elements are again stored using the exchange sort procedure and the sorted elements are stored in a separate array available.

VERIFICATION WITH AN EXAMPLE .

1 3 B D 2 4 8 6 A E F 2 8 5 7 C 4 Graph with 7 Nodes and 7 Paths G .

edges & weights (noted) Path length is stored Path length is compared Swap the lengths & store the minimum length path in a variable False If two paths have the same length True Find the path with minimum edges &store in an array Print the minimum path Stop .FLOW CHART FOR PATH COMPUTATION ALOGRITHM Start Number of paths.

THE NUMBER OF EDGES OF PATH AG:1 11. The major advantages of the system are fast and accurate information retrieval. THE 7 PATH IS (ACG) AND IT¶S LENGTH IS 9 9. THE 4 PATH IS (ABB1 G) AND IT¶S LENGTH IS 11 6. The algorithm is coded in C and the results are verified with different net work configuration for various numbers of nodes. THE 6 PATH IS (AG) AND IT¶S LENGTH IS 8 8. It can address any real world problem. THE 2 PATH IS (ABB1 DFG) AND IT¶S LENGTH IS 17 4. THE 5 PATH IS (AEG) AND IT¶S LENGTH IS 8 7. CONCLUSION Hence the proposed algorithm is used to find the minimum path of a graph or a network with any complex structure. Finding the minimum path even if there are two paths with the same length that too the minimum length. THE 1 PATH IS (ABDFG) AND IT¶S 2. 2. find the cheapest way to travel between two locations. LENGTHIS 16 3.OUT PUT THE PATHS ARE AS FOLLOWD 1. Construction of Transmission Lines at power training centre at PSTI manual 3. The generalized software is highly interactive and user friendly. Data structures and algorithms by Scham¶s series 2. APPLICATIONS Industrial automation Telecommunication Civil road construction Electrical transmission lines Local area net works (LAN). Programming in ANSI C by BalaGuruswamy . THE 3 PATH IS (ABG) AND IT¶S LENGTH IS 10 5. THE NUMBER OF EDGESOF PATH AEG:2 10. REFERENCES 1. THE SHORTEST PATH IS (AG) WITH LENGTH 8 AND 1 EDGE. ease of use and time saving. 1.

.1.

Sign up to vote on this title

UsefulNot useful- Asa 2011 Graphs
- 100116
- Dijkstra Algorithm With Expalna
- Graphs
- DSA Fundamentals Graph Sahni
- DS REC Rajkumar
- Comp Sci
- Floyd-Warshall Algorithm
- Ant Colony Optimisation Applied to a 3D Shortest Path Problem
- Introduction to Graph Theory
- unit 4
- The Shortest Route
- 03 Priyantha Localization Wireless Sensor Networks Cricket
- maaatom5
- Lib Guide
- CS1114_prelim_review
- MR_lec10
- 052180230X_Graph
- arxiv.org_pdf_1407.5138v1
- 15RatnakarK-final.pdf
- 40334252 Gate Question Papers
- Gate Question Papers
- fuzzy_3
- Dijk Stra
- Lecture3 Partition
- Similarity Flooding a Versatile Graph Matching Algorithm
- App Inventor Graph.docx
- Accelerating Performance With GPU Computing
- Are You Moved by Your Social Network Application
- lecture 3 the probabilistic method - basic ideas
- SHORTEST PATH COMPUTATION IN A TRANSMISSION LINE NETWORK