Prims-Aided Dijkstra Algorithm for Adaptive Protection in Microgrids

Swathika, O.V. Gnana; Hemamalini, S.

doi:10.1109/jestpe.2016.2581986

Cited by 89 publications

(47 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…According to the concept of minimum spanning tree there can exist only one path from a particular node to the source [11][12][13][14][15][16][17]. This is possible only if the graph is converted to a tree.…”

Section: Results and Analysis 31 Simulation Resultsmentioning

confidence: 99%

Active Node Detection in A Reconfigurable Microgrid using Minimum Spanning Tree Algorithms

Majee

Nanda

O.V

2017

IJEECS

View full text Add to dashboard Cite

show abstract

Section: Results and Analysis 31 Simulation Resultsmentioning

confidence: 99%

Active Node Detection in A Reconfigurable Microgrid using Minimum Spanning Tree Algorithms

Majee

Nanda

O.V

2017

IJEECS

View full text Add to dashboard Cite

show abstract

“…Nevertheless, changes and modifications are thought to find the minimal path between distribution transformers and the service point in less time. The proposed modified Prim requires a graph G = (V,E) of order n and size m; consequently, the vertex set V with exactly n − 1 edges, which belongs to the edge set E, permits to construct a spanning tree T of G joining all the vertices without loop or mesh topologies [10,31,32,34]. Based on what precedes, not only the medium voltage network but also the location of distribution transformers were determined based on the modified Prim algorithm, due to the fact that the minimal tree ensures the minimal cost of the total grid.…”

Section: Network Planning Based On Graph Theorymentioning

confidence: 99%

A Decision-Making Tool for Electric Distribution Network Planning Based on Heuristics and Georeferenced Data

2019

View full text Add to dashboard Cite

Designing and planning of electrical distribution systems is a task that design engineers perform during their daily activities. These designs, which are completed manually, are made according to the expertise of the designer; as a consequence, the obtained product varies depending on the person in charge of executing the layout, highlighting the fact that those designs are susceptible to involuntary human mistakes resulting in no optimal solutions and high cost consequences. The work presented below explains the implementation of an intelligent decision tool that allows the design of network distribution system planning considering the current electrical company standards, in order to have a clear and quick initial overview of the configuration that an electricity network should have in response to an increasing demand, considering not only the coverage and capacity of the transformers but also voltage drop along the conductors, which must not exceed 3% of the nominal value. The objective of this design tool is that it can be applicable in real scenarios; for this reason, the routing of the conductors and the location of the transformers are based on a georeferenced map. It is important to mention that the optimization problem is focused on minimizing the amount of transformers and at the same time ensuring a total coverge of 100% end users connected to the grid. This tool would be very useful in the educational and practical fields, since private and public electricity companies could use it to obtain a quick and efficient base product on which they could start to develop expansion and planning of distribution networks. The concept and development of such a tool is the subject of this paper.

show abstract

“…Poin penting yang sangat bermanfaat bagi pengguna adalah menemukan rute terpendek untuk sampai ke lokasi [16]. Menemukan rute terdekat merupakan masalah yang fundamental [17]. Menghitung rute terpendek dibutuhkan setiap simpul dari titik awal sampai titik akhir yang terhubung kemudian dibandingkan dengan simpul lainnya [18].…”

Section: Iunclassified

Penerapan Algoritma Dijkstra Untuk Menentukan Rute Terbaik Pada Mobile E-Parking Berbasis Sistem Informasi Geografis

Prianto

Kusnadi

2018

jpit

View full text Add to dashboard Cite

Lack of information about the posision of a place and find the best route to get to a destination is complicated, especially looking for a route in finding a parking space. Unavailability of applications that provide information and navigate parking users to find the best route in realtime is a problem that must be answered. Dijkstra's algorithm is one method of solving problems in finding the best route. The Dijkstra algorithm has compared the possible routes to be traversed and calculated every possible distance. The route with the shortest distance would be the best choice This application was built using an Android-based Geographic Information System that utilizes the Google Maps feature as a parking user interface service. This study uses the Java programming language with Android Studio as an IDE (Integrated Development Environment) and the prototyping model is used in developing problem solving and using UML (Unified Modeling Language) as a system design tool. The results that have been achieved from this research is that Dijkstra's algorithm can answer the problem faced by providing the best route navigation from the user's location to the parking lot at the destination Abstrak  Kurangnya informasi mengenai posisi suatu tempat dan menemukan rute terbaik untuk menuju sebuah tempat tujuan termasuk hal yang cukup rumit terutama mencari rute dalam menemukan tempat parkir. Tidak tersedianya aplikasi yang menyediakan informasi serta menavigasi pengguna parkir untuk menemukan rute terbaik secara realtime menjadi suatu masalah yang harus dicari jawabannya. Algoritma Dijkstra merupakan salah satu metode penyelesaian masalah dalam pencarian rute terbaik. Algoritma Dijkstra membandingkan kemungkinan rute yang akan dilalui dan dihitung setiap kemungkinan jarak. Rute dengan jarak terpendek akan menjadi pilihan terbaik. Aplikasi ini dibangun dengan menggunakan sistem informasi geografis berbasis android yang memanfaatkan fitur Google Maps sebagai layanan antar muka pengguna parker. Penelitian ini menggunakan bahasa pemrograman Java dengan Android Studio sebagai IDE (Integrated Development Environment) dan model prototyping digunakan dalam pengembangan penyelesaian masalah serta menggunakan UML (Unified Modelling Language) sebagai tools perancangan system. Hasil yang telah dicapai dari penelitian ini adalah algoritma Dijkstra dapat menjawab masalah yang dihadapi yakni memberikan navigasi rute terbaik dari lokasi pengguna menuju tempat parkir di lokasi tujuan.

show abstract

Prims-Aided Dijkstra Algorithm for Adaptive Protection in Microgrids

Cited by 89 publications

References 13 publications

Active Node Detection in A Reconfigurable Microgrid using Minimum Spanning Tree Algorithms

Active Node Detection in A Reconfigurable Microgrid using Minimum Spanning Tree Algorithms

A Decision-Making Tool for Electric Distribution Network Planning Based on Heuristics and Georeferenced Data

Penerapan Algoritma Dijkstra Untuk Menentukan Rute Terbaik Pada Mobile E-Parking Berbasis Sistem Informasi Geografis

Contact Info

Product

Resources

About