PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIM
Determination of the minimum spanning tree are widely used to solve optimization problems of finding solutions to problems that require minmum. In the electricity distribution network, minimum spanning tree (MST) is used to find the minimum length of cable for electricity network system becomes more...
Main Authors: | , |
---|---|
Format: | Article |
Language: | Indonesian |
Published: |
Universitas Pembangunan Nasional "Veteran" Yogyakarta
2014-09-01
|
Series: | Telematika |
Online Access: | http://fajar.upnyk.ac.id/index.php/telematika/article/view/294 |
id |
doaj-f9cfbd79e4f147248c29cc6a22436e8e |
---|---|
record_format |
Article |
spelling |
doaj-f9cfbd79e4f147248c29cc6a22436e8e2020-11-24T21:35:49ZindUniversitas Pembangunan Nasional "Veteran" YogyakartaTelematika1829-667X2460-90212014-09-0191251PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIMHadiyanto HadiyantoMuhammad AlhanDetermination of the minimum spanning tree are widely used to solve optimization problems of finding solutions to problems that require minmum. In the electricity distribution network, minimum spanning tree (MST) is used to find the minimum length of cable for electricity network system becomes more optimal. Minimum weight of a MST primary distribution power network is strongly influenced by the geographical conditions of a region in the form of contour data. This research was done by designing a model of primary distribution power network graph in accordance with the data obtained. In finding the minimum weight for each side of the network graph should include parameters elevation, high point / node, and the distance between points / nodes. Furthermore, the graph is done by computer calculation and simulation to get the electricity distribution network primary MST using Prim's algorithm with the help of ArcView GIS 3.3 program through the avenue script. Prim's algorithm included in the category of good or efficient algorithms, because the shape of polynomial time complexity in n, where n is a measure of the number of vertices or sides. Based on the test results have shown that the algorithm Prim MST ability to determine the primary distribution grid is much better if based on the geographical conditions of a region. In addition, Prim's algorithm graph computation time in generating the MST based on the data that is not based on the contour and contour data are quadratic. Keywords: minimum spanning tree, prim's algorithm, contours, complexity timehttp://fajar.upnyk.ac.id/index.php/telematika/article/view/294 |
collection |
DOAJ |
language |
Indonesian |
format |
Article |
sources |
DOAJ |
author |
Hadiyanto Hadiyanto Muhammad Alhan |
spellingShingle |
Hadiyanto Hadiyanto Muhammad Alhan PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIM Telematika |
author_facet |
Hadiyanto Hadiyanto Muhammad Alhan |
author_sort |
Hadiyanto Hadiyanto |
title |
PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIM |
title_short |
PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIM |
title_full |
PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIM |
title_fullStr |
PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIM |
title_full_unstemmed |
PENENTUAN POHON RENTANG MINIMUM BERDASARKAN KONDISI GEOGRAFIS SUATU WILAYAH DENGAN ALGORITMA PRIM |
title_sort |
penentuan pohon rentang minimum berdasarkan kondisi geografis suatu wilayah dengan algoritma prim |
publisher |
Universitas Pembangunan Nasional "Veteran" Yogyakarta |
series |
Telematika |
issn |
1829-667X 2460-9021 |
publishDate |
2014-09-01 |
description |
Determination of the minimum spanning tree are widely used to solve optimization
problems of finding solutions to problems that require minmum. In the electricity distribution
network, minimum spanning tree (MST) is used to find the minimum length of cable for
electricity network system becomes more optimal. Minimum weight of a MST primary
distribution power network is strongly influenced by the geographical conditions of a region in
the form of contour data. This research was done by designing a model of primary distribution
power network graph in accordance with the data obtained. In finding the minimum weight for
each side of the network graph should include parameters elevation, high point / node, and the
distance between points / nodes. Furthermore, the graph is done by computer calculation and
simulation to get the electricity distribution network primary MST using Prim's algorithm with the
help of ArcView GIS 3.3 program through the avenue script.
Prim's algorithm included in the category of good or efficient algorithms, because the
shape of polynomial time complexity in n, where n is a measure of the number of vertices or
sides. Based on the test results have shown that the algorithm Prim MST ability to determine
the primary distribution grid is much better if based on the geographical conditions of a region.
In addition, Prim's algorithm graph computation time in generating the MST based on the data
that is not based on the contour and contour data are quadratic.
Keywords: minimum spanning tree, prim's algorithm, contours, complexity time |
url |
http://fajar.upnyk.ac.id/index.php/telematika/article/view/294 |
work_keys_str_mv |
AT hadiyantohadiyanto penentuanpohonrentangminimumberdasarkankondisigeografissuatuwilayahdenganalgoritmaprim AT muhammadalhan penentuanpohonrentangminimumberdasarkankondisigeografissuatuwilayahdenganalgoritmaprim |
_version_ |
1716692421117476864 |