UNIVERSITAS BINA DARMA, UNIVERSITAS BINA DARMA (2022) Jurnal Ilmiah Teknik Elektro Komputer dan Informatika Bellman-Ford Algorithm for Completion of Route Determination: An Experimental Study. Jurnal Ilmiah Teknik Elektro Komputer dan Informatika Bellman-Ford Algorithm for Completion of Route Determination: An Experimental Study.
|
Text
16943-46188-2-PB.pdf Download (474kB) | Preview |
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 under 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 to be 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). However, this algorithm is better in terms of finding optimal solutions and solving singe pair routes
| Item Type: | Article |
|---|---|
| Subjects: | L Education > L Education (General) |
| Divisions: | Faculty of Law, Arts and Social Sciences > School of Education |
| Depositing User: | Mr Edi Surya Negara |
| Date Deposited: | 20 Jun 2022 07:35 |
| Last Modified: | 20 Jun 2022 07:35 |
| URI: | http://eprints.binadarma.ac.id/id/eprint/13595 |
Actions (login required)
 |
View Item |
