Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Teknik Elektro Komputer dan Informatika (JITEKI)
Hutrianto Hutrianto
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering

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

Found 1 Documents
Search

 1 
Bellman-Ford Algorithm for Completion of Route Determination: An Experimental Study Ari Muzakir; Hutrianto Hutrianto
Jurnal Ilmiah Teknik Elektro Komputer dan Informatika Vol 6, No 1 (2020): June
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/jiteki.v16i1.16943

Abstract

In this study a review of the existing Bellman-Ford Algorithm by conducting tests to see the accuracy of the route data or the shortest route. In this study there are fifth locations that will be tested to see whether the route is really in accordance with the actual situation. The shortest path is part of the field of graph theory. If a graph has weight, then in the case of the shortest route, how can we do the minimization of the total weight of the route. This is what was done in this study to see how optimal the Bellman-Ford Algorithm is in handling the shortest route so that it is more accurate. The fifth Mall data is the most frequently visited by people in the city of Palembang. The five malls are Opi Mall, International Plaza, Palembang Indah Mall, Palembang Square and Palembang Icon. The conclusion from the results of this study is that the Bellman-Ford Algorithm is more complicated to do in the search for calculations manually on the completion of the Traveling Salesman Problem (TSP), but this algorithm is better in terms of finding optimal solutions and solving singe pair routes.
Co-Authors Ari Muzakir