Article Per Year (5 Year)
p-Index From 2021 - 2026
0.562
P-Index
This Author published in this journals
All Journal Journal of Intelligent Decision Support System (IDSS) Jurnal Mandiri IT
Wresti Andriani
STMIK YMI Tegal , Kota Tegal, Indonesia
Computer Science & IT Library & Information Science Mathematics

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
Comparison of three fuzzy logic algorithm methods for cellular selection Gunawan Gunawan; Wresti Andriani; Sawaviyya Anandianskha
Journal of Intelligent Decision Support System (IDSS) Vol 6 No 3 (2023): September : Intelligent Decision Support System (IDSS)
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/idss.v6i3.154

Abstract

Many cell phone types are on the market today, increasingly making users feel confused and confused about choosing the cell that suits their needs. As one of the most essential needs at this time, users must be able to match their cellular needs with their income. Many smartphone products are offered. To help users in this study using three methods from the Fuzzy Logic algorithm for Decision Support Systems in choosing cellular according to their needs and desires; from the research that has been done, it is found that using the Fuzzy Tsukamoto method the accuracy is better than Mamdani which is equal to 0.02135, Mamdani is as large as 0.0643, while Sugeno is 0.1007. The cellular chosen is the Samsung A73 brand.
Application of the Dijkstra method in finding the shortest route for hospitals in Kabupaten Tegal Gunawan Gunawan; Wresti Andriani; Khadziqul Humam Munfi
Jurnal Mandiri IT Vol. 12 No. 2 (2023): October: Computer Science and Field.
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v12i2.238

Abstract

Health services are one of the most critical aspects of human life. Getting medical care quickly and efficiently can be a determining factor in saving a person's life in an emergency. In this article, we will review the application of the Dijkstra Method in finding the shortest route to Mitra Siaga hospitals in Kabupaten Tegal. This article is expected to contribute to understanding and developing a more efficient transportation system in Kabupaten Tegal, focusing on health services. Dijkstra algorithm for determining the shortest route. Dijkstra's algorithm is an algorithm that intends to find the shortest path on a graph. The principle of the Dijkstra Algorithm is searching for two passes with the most negligible weight. Based on the results of testing 10 times, the accuracy of this application is 100%. In this study, limited to the initial location tested, this application has not used the current location at its initial location. For the development of this application, you can use the current location at the initial location so that this application runs optimally
Application of the Dijkstra method in finding the shortest route for hospitals in Kabupaten Tegal Gunawan Gunawan; Wresti Andriani; Khadziqul Humam Munfi
Jurnal Mandiri IT Vol. 12 No. 2 (2023): October: Computer Science and Field.
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v12i2.238

Abstract

Health services are one of the most critical aspects of human life. Getting medical care quickly and efficiently can be a determining factor in saving a person's life in an emergency. In this article, we will review the application of the Dijkstra Method in finding the shortest route to Mitra Siaga hospitals in Kabupaten Tegal. This article is expected to contribute to understanding and developing a more efficient transportation system in Kabupaten Tegal, focusing on health services. Dijkstra algorithm for determining the shortest route. Dijkstra's algorithm is an algorithm that intends to find the shortest path on a graph. The principle of the Dijkstra Algorithm is searching for two passes with the most negligible weight. Based on the results of testing 10 times, the accuracy of this application is 100%. In this study, limited to the initial location tested, this application has not used the current location at its initial location. For the development of this application, you can use the current location at the initial location so that this application runs optimally
Co-Authors Gunawan Khadziqul Humam Munfi Sawaviyya Anandianskha