Bellman-Ford Algorithm for Completion of Route Determination: An Experimental Study
DOI:
https://doi.org/10.26555/jiteki.v16i1.16943Keywords:
Bellman-ford algorithm, Shortest route search, Traveling Salesman Problem, a review of Algorithms, Experimental studyAbstract
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.References
R. Dondi, G. Mauri, and I. Zoppis, “Graph Algorithms,†in Encyclopedia of Bioinformatics and Computational Biology, Elsevier, 2019, pp. 940–949.
R. Bellman, “On a routing problem,†Q. Appl. Math., vol. 16, no. 1, pp. 87–90, 1958. doi: 10.1090/qam/102435
J. R. S. C. Mateo, “Weighted Sum Method and Weighted Product Method,†in Multi Criteria Analysis in the Renewable Energy Industry, J. R. San Cristóbal Mateo, Ed. London: Springer, 2012, pp. 19–22. doi: 10.1007/978-1-4471-2346-0_4
A. J. J. M. Marcelis, “On the classification of attribute evaluation algorithms,†Sci. Comput. Program., vol. 14, no. 1, pp. 1–24, Jun. 1990, doi: 10.1016/0167-6423(90)90055-I.
Neha and A. Kaushik, “Extended Bellman Ford Algorithm with Optimized Time of Computation,†in Proceedings of International Conference on ICT for Sustainable Development, vol. 409, S. C. Satapathy, A. Joshi, N. Modi, and N. Pathak, Eds. Singapore: Springer Singapore, 2016, pp. 241–247. doi: 10.1007/978-981-10-0135-2_23
C. Ramadani, “Dasar Algoritma dan struktur data dengan Bahasa Java,†Yogyak. Penerbit Andi, 2015.
V. Patel and C. Bagar, “A survey paper of Bellman-Ford algorithm and Dijkstra algorithm for finding shortest path in GIS application,†Int. J. P2P Netw. Trends Technol., vol. 5, pp. 1–4, 2014. Online
R. Mehrotra and S. Budhiraja, “A Comparative Study between Bellman-Ford Algorithm and Dijkstras- Algorithms,†Internatonal Journal of Innovative Research in Technology (IJIRT), vol. 1, no. 5, p. 3, 2014. Online
N. Nggufron, R. Rochmad, and M. Mashuri, “Pencarian Rute Terbaik Pemadam Kebakaran Kota Semarang Menggunakan Algoritma Dijkstra dengan Logika Fuzzy sebagai Penentu Bobot pada Graf,†Unnes J. Math., vol. 8, no. 1, pp. 40–49, 2019. doi: 10.15294/ujm.v8i1.19461
F. Anggraini and S. Mingparwoto, “Penerapan Metode Algoritma Bellman–Ford Dalam Aplikasi Pencarian Lokasi Perseroan Terbatas di PT. Jakarta Industrial Estate Pulogadung (PT. JIEP),†J. Teknol., vol. 7, no. 1, pp. 28–34, 2015. doi: 10.24853/jurtek.7.1.28-34
D. T. Wiyanti, “Algoritma Optimasi Untuk Penyelesaian Traveling Salesman Problem,†J. Transform., vol. 11, no. 1, pp. 1–6, Jul. 2013, doi: 10.26623/transformatika. v11i1.76.
J. O. Agung, T. Efendi, and H. Agung, “Analisis Perbandingan Algoritma Floyd-Warshall Dengan Algoritma Bellman-Ford Dalam Pencarian Rute Terpendek Menuju Museum di Jakarta,†J Sains Dan Teknol, vol. 5, no. 1, pp. 1–7, 2018. Online
P. Kroll and P. Kruchten, the rational unified process made easy: a practitioner’s guide to the RUP. Addison-Wesley Professional, 2003.
A. S. Rosa, “Rekayasa perangkat lunak terstruktur dan berorientasi objek,†2016.
H. Darmadi, “Metode penelitian pendidikan dan sosial,†Bdg. Alf., 2014.
A. Jaedun, “Pengembangan Profesionalisme Guru Melalui Penulisan Karya Tulis Ilmiah,†2011, vol. 1. Online
Thippeswamy.K, Hanumanthappa.J, and Manjaiah, “A Study on Contrast and Comparison between Bellman-Ford algorithm and Dijkstra’s Algorithms,†National Conference on wireless Networks-09 (NCOWN-2010). Online
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with JITEKI agree to the following terms:
- Authors retain copyright and grant the journal the right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
This work is licensed under a Creative Commons Attribution 4.0 International License
