Professional Documents
Culture Documents
ON
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
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.
Transfer of bulk power from the generating station/substation to the load centers.
Power transmission at higher voltage and reduced current for the same quantum
of energy there by reducing the line loss (I2R)
Efficient, safe and reliable power supply.
AC HVDC
India 66 500
110
132 800
220
400
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.
TYPES OF TOWERS
Broad Based
Narrow Based
Square Base
Rectangular Base
Y or V shaped supported by external and internal guys.
STRUCTERS
Mild steel
Mild steel + High tensile steel
SHAPES
Vertical
Horizontal
Delta
CROSSINGS
River crossing
Railway crossing
Road crossing
Power line crossing
Communication line crossing
Aerodromes
Radar centers
Rifle ranges (Military target areas)
Helipads
LINE PLANNING
The basic parameters for selection of material and standards, once decided will help
adopting sound construction practices estimation of material labour and transports
facilities should have been assessed. The material should be made available at site,
required working equipped with tools and tackles should be available as when required.
PROBLEM STATEMENT
The main objective of the proposed algorithm is to find the minimum path in a
transmission line network. Starting from the source node to the destination node, there
may be several paths in a net work. The lengths of a each path are taken in to
consideration and they are compared
with each other respectively. 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.
This is the normal procedure for finding the shortest path or minimum path of a
transmission network or graph.
Several algorithms have been discovered so far to compute the short path in a graph. For
instance Dijikstra’s algorithm computes the shortest path from the source node to every
other node in the network. Similarly Wars Hal’s algorithm computes the shortest path
from the source node to destination node of a given network.
All this algorithms described so far, find the minimum path of a communication network
or a graph, where the network or graph, where network or the graph has exactly only one
minimum path here question arises. What will be the minimum path if a network or graph
has more than two paths having the same length (eight), that too the minimum lengths?
The solution for the above question has not been answered yet. But the proposed
algorithm gives a precise solution for the question discussed above.
2
4
6
A E F
2
8
7
5
C G
4
Start
False
If two
paths have
the same
length
True
Stop
OUT PUT
THE PATHS ARE AS FOLLOWD
1. THE 1 PATH IS (ABDFG) AND IT’S
2. LENGTHIS 16
3. THE 2 PATH IS (ABB1DFG) AND IT’S LENGTH IS 17
4. THE 3 PATH IS (ABG) AND IT’S LENGTH IS 10
5. THE 4 PATH IS (ABB1 G) AND IT’S LENGTH IS 11
6. THE 5 PATH IS (AEG) AND IT’S LENGTH IS 8
7. THE 6 PATH IS (AG) AND IT’S LENGTH IS 8
8. THE 7 PATH IS (ACG) AND IT’S LENGTH IS 9
9. THE NUMBER OF EDGESOF PATH AEG:2
10. THE NUMBER OF EDGES OF PATH AG:1
11. THE SHORTEST PATH IS (AG) WITH LENGTH 8 AND 1 EDGE.
APPLICATIONS
Industrial automation
Telecommunication
Civil road construction
Electrical transmission lines
Local area net works (LAN).
CONCLUSION
Hence the proposed algorithm is used to find the minimum path of a graph or a
network with any complex structure. The generalized software is highly interactive
and user friendly. The algorithm is coded in C and the results are verified with
different net work configuration for various numbers of nodes. It can address any real
world problem.
1. find the cheapest way to travel between two locations.
2. Finding the minimum path even if there are two paths with the same length that too
the minimum length.
The major advantages of the system are fast and accurate information retrieval, ease
of use and time saving.
REFERENCES
1. Data structures and algorithms by Scham’s series
2. Construction of Transmission Lines at power training centre at PSTI manual
3. Programming in ANSI C by BalaGuruswamy
1.