Bellman-Ford Algorithm for Completion of Route Determination: An Experimental Study
Abstract
Keywords
Full Text:
PDFReferences
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
DOI: http://dx.doi.org/10.26555/jiteki.v16i1.16943
Refbacks
Copyright (c) 2020 Universitas Ahmad Dahlan
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
About the Journal | Journal Policies | Author | Information |
Organized by Electrical Engineering Department - Universitas Ahmad Dahlan
Published by Universitas Ahmad Dahlan
Website: http://journal.uad.ac.id/index.php/jiteki
Email 1: jiteki@ee.uad.ac.id