SHORTEST PATH COMPUTATION IN A TRANSMISSION LINE NETWORK
• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 project topics Active In SP Posts: 2,492 Joined: Mar 2010 02-04-2010, 03:14 PM 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. Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
 smart paper boy Active In SP Posts: 2,053 Joined: Jun 2011 21-06-2011, 12:38 PM   SHORTESTPATHCOMPUTATIONINATRANSMISSIONLINENETWORK.doc (Size: 62 KB / Downloads: 67) 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 • 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. 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.  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.