Penerapan Algoritma Floyd Warshall Dalam Aplikasi Penentuan Rute Terpendek Mencari Lokasi BTS (Base Tower Station) Pada PT.GCI Palembang

Vera Apriliani Nawagusti(1*)
(1) Politeknik Negeri Sriwijaya
(*) Corresponding Author

https://doi.org/10.25077/TEKNOSI.v4i2.2018.81-88


Abstrak


For PT.GCI Palembang optimization of the shortest route is needed in the process of finding the location of BTS (Base Tower Station) because with the optimization of the shortest route determination can assist the technician in optimizing the distance to the location of BTS needs to be done maintenance and repair so as to increase the efficiency of time and the required costs. The shortest route problem is a problem in finding the path between two vertices on a weighted graph that has a combined value of the number of weights on the side of the graph passed by the minimum number. In this research using Floyd Warshall algorithm to determine the shortest route. Where the Floyd Warshall algorithm can compare all track opportunities in the graph for each side of all the nodes it passes to the least amount. Based on the results of calculations from this research obtained the shortest route that is from point 1 – 4- 3 – 2 that is equal to 10,9 km

Kata Kunci


Penentuan Rute Terpendek


Teks Lengkap:

PDF


Referensi


PT. GCI Indonesia. "Products & Services" Internet : http://www.gcidesign.co.id/index.php/products/, [Aug 12, 2018]

B. Yulianto et al., “Location based services: positioning techniques,” Provider, vol. 12, no. 1, pp. 4982–4987, 2010.

D. T. Salaki, “Penentuan Lintasan Terpendek dari FMIPA ke Rektorat dan Fakultas lain di UNSRAT Manado menggunakan Algoritma Djikstra,” Ilm. Sains, vol. 11, no. Djikstra, pp. 73–76, 2011.

J. T. Informatika, F. Teknik, and U. H. Oleo, “Aplikasi pencarian rute terpendek apotek di kota kendari menggunakan algoritma,” vol. 3, no. 1, pp. 9–16, 2017.

R. M and R. F. Uzzy, “Penentuan Jalur Terpendek Menuju Cafe Di Kota Malang Menggunakan Metode Bellman-Ford dengan Location Based Service Berbasis Android,” J. Ilm. Teknol. dan Inf. ASIA, vol. 8, no. 2, pp. 49–64, 2014.

M. S. Handaka, “Perbandingan Algoritma Dijkstra ( Greedy ), Bellman-Ford ( BFS-DFS ), dan Floyd-Warshall (Dynamic Programming) dalam Pengaplikasian Lintasan Terpendek pada Link-State Routing Protocol,” 2011.

M. K. Ni Ketut Dewi Ari Jayanti, “Letak Parkir,” Semin. Nas. Inform., pp. 75–81, 2014.

R. Aprian and D. Novandi, “Perbandingan Algoritma Dijkstra dan Algoritma Floyd-Warshall dalam Penentuan Lintasan Terpendek ( Single Pair Shortest Path ),” pp. 1–5, 2007.

R. Saputra, “Sistem Informasi Geografis Pencarian Rute Optimum Obyek Wisata Kota Yogyakarta Dengan Algoritma Floyd-Warshall,” J. Mat., vol. 14, pp. 19–24, 2011.

K. Surendro, “Pemanfaatan Enterprise Architecture Planning Untuk Perencanaan Strategis Sistem informasi,” J. Inform., vol. 8, no. 1, pp. 1–9, 2007.

F. Mahdia and F. Noviyanto, “Pemanfaatan Google Maps API untuk Pembangunan Sistem Informasi Manajemen Bantuan Logistik Pasca Bencana Alam Berbasis Mobile Web (Studi Kasus : Badan Penanggulangan Bencana Daerah Kota Yogyakarta ),” J. Sarj. Tek. Inform., vol. 1, no. 1, pp. 162–171, 2013.


Artikel Statistik

Abstrak telah dilihat : 2257 kali
PDF telah dilihat : 4830 kali

Refbacks

  • Saat ini tidak ada refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

 

Alamat Redaksi :
Departemen Sistem Informasi, Fakultas Teknologi Informasi
Universitas Andalas
Kampus Limau Manis, Padang 25163, Sumatera Barat

email: teknosi@fti.unand.ac.id

  Jumlah Pengunjung :

 

Creative Commons License
This work by JSI-Unand and licensed under a CC BY-SA 4.0 International License.