使用Kruskal计算自流水分布路径最短的路线

Diah Ayu Retnani Wulandari, F. N. Arifin
{"title":"使用Kruskal计算自流水分布路径最短的路线","authors":"Diah Ayu Retnani Wulandari, F. N. Arifin","doi":"10.30645/j-sakti.v2i2.72","DOIUrl":null,"url":null,"abstract":"Water flow distribution to home residents from the artesian well is affected by infrastructure. The more houses that distributed makes decreased amount supply of artesian water in every house. the longer of pipe leight and many branches traversed makes decrease of water supply because there will be many possible pipeline leaks. The more pipes used make the more expensive infrastructure cost. This problem occurs in Jubung area. These problems is one variation of the minimum Spanning Tree problems. This problem can be solved by the shortest path optimization route. It uses network method by implementing graph theory through kruskal algorithm. The first step is determined the nodes and sides. Nodes represent house and the sides represents the connecting pipes between houses. Kruskal is chosen because the kruskal focuses on the side and the graph is incomplete. focus of this study is the length optimation of the connecting pipe that is represented by side. In the pipe infrastructure figure map is representing of an incomplete graph because there are several nodes that are not connected to all nodes because it is adapted to the contour of the land that is not possible traversed the pipe. The results is there are several paths that are changed, especially the side to connect between node 1-4, 4-12, 19-20, 21-6 dispensed because forming cycles. The result of this research is kruskal can make decreasing infrastrukture cost Rp.7.535.500 with length of 201,5 meter so can save Rp.4.401.000 from Rp Rp.11.936.500.","PeriodicalId":402811,"journal":{"name":"J-SAKTI (Jurnal Sains Komputer dan Informatika)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Penentuan Rute Terpendek Jalur Distribusi Air Artesis Menggunakan Kruskal\",\"authors\":\"Diah Ayu Retnani Wulandari, F. N. Arifin\",\"doi\":\"10.30645/j-sakti.v2i2.72\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Water flow distribution to home residents from the artesian well is affected by infrastructure. The more houses that distributed makes decreased amount supply of artesian water in every house. the longer of pipe leight and many branches traversed makes decrease of water supply because there will be many possible pipeline leaks. The more pipes used make the more expensive infrastructure cost. This problem occurs in Jubung area. These problems is one variation of the minimum Spanning Tree problems. This problem can be solved by the shortest path optimization route. It uses network method by implementing graph theory through kruskal algorithm. The first step is determined the nodes and sides. Nodes represent house and the sides represents the connecting pipes between houses. Kruskal is chosen because the kruskal focuses on the side and the graph is incomplete. focus of this study is the length optimation of the connecting pipe that is represented by side. In the pipe infrastructure figure map is representing of an incomplete graph because there are several nodes that are not connected to all nodes because it is adapted to the contour of the land that is not possible traversed the pipe. The results is there are several paths that are changed, especially the side to connect between node 1-4, 4-12, 19-20, 21-6 dispensed because forming cycles. The result of this research is kruskal can make decreasing infrastrukture cost Rp.7.535.500 with length of 201,5 meter so can save Rp.4.401.000 from Rp Rp.11.936.500.\",\"PeriodicalId\":402811,\"journal\":{\"name\":\"J-SAKTI (Jurnal Sains Komputer dan Informatika)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J-SAKTI (Jurnal Sains Komputer dan Informatika)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30645/j-sakti.v2i2.72\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J-SAKTI (Jurnal Sains Komputer dan Informatika)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30645/j-sakti.v2i2.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

从自流井流向家庭居民的水流分布受基础设施的影响。分布的房屋越多,每户自流水的供给量就越少。管道的长度越长,分支越多,管道泄漏的可能性越大,供水量就越少。管道越多,基础设施成本就越高。这一问题发生在竹峰地区。这些问题是最小生成树问题的一种变体。这个问题可以通过最短路径优化路径来解决。它采用网络方法,通过kruskal算法实现图论。第一步是确定节点和边。节点代表房屋,侧面代表房屋之间的连接管道。之所以选择Kruskal,是因为Kruskal集中在侧面,而图是不完整的。本文研究的重点是以侧面为代表的连接管的长度优化。在管道基础设施中,图是一个不完整的图,因为有几个节点没有连接到所有节点,因为它是适应不可能穿过管道的土地轮廓的。结果是有几个路径发生了变化,特别是节点1- 4,4 - 12,19 - 20,21 -6之间的连接侧由于形成循环而被分配。研究结果表明,kruskal可以使长度为2011.5米的基础设施成本降低7.535.500卢比,因此可以从11.936.500卢比中节省4.401.000卢比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Penentuan Rute Terpendek Jalur Distribusi Air Artesis Menggunakan Kruskal
Water flow distribution to home residents from the artesian well is affected by infrastructure. The more houses that distributed makes decreased amount supply of artesian water in every house. the longer of pipe leight and many branches traversed makes decrease of water supply because there will be many possible pipeline leaks. The more pipes used make the more expensive infrastructure cost. This problem occurs in Jubung area. These problems is one variation of the minimum Spanning Tree problems. This problem can be solved by the shortest path optimization route. It uses network method by implementing graph theory through kruskal algorithm. The first step is determined the nodes and sides. Nodes represent house and the sides represents the connecting pipes between houses. Kruskal is chosen because the kruskal focuses on the side and the graph is incomplete. focus of this study is the length optimation of the connecting pipe that is represented by side. In the pipe infrastructure figure map is representing of an incomplete graph because there are several nodes that are not connected to all nodes because it is adapted to the contour of the land that is not possible traversed the pipe. The results is there are several paths that are changed, especially the side to connect between node 1-4, 4-12, 19-20, 21-6 dispensed because forming cycles. The result of this research is kruskal can make decreasing infrastrukture cost Rp.7.535.500 with length of 201,5 meter so can save Rp.4.401.000 from Rp Rp.11.936.500.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Rancang Bangun Pengatur Suhu Dan Kelembaban Ruang Server Berbasis IoT Pengelompokkan Data Pembelian Tinta Dengan Menggunakan Metode K-Means Pengembangan Model Sistem Pendukung Keputusan Dengan Kombinasi Metode Fuzzy Tahani Dan Topsis Dalam Penilaian Kinerja Instruktur Sistem Monitoring Lulusan Perguruan Tinggi Dalam Memasuki Dunia Kerja Menggunakan Tracer Study Perbandingan Algoritma ELM Dan Backpropagation Terhadap Prestasi Akademik Mahasiswa
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1