SIMULASI JARINGAN JALAN DI KOTA SEMARANG BERBASIS ALGORITMA FLOYD-WARSHALL UNTUK MENANGANI MASALAH LINTASAN TERPENDEK

  • Harsono Harsono Universitas Negeri Semarang
  • Mulyono Mulyono Universitas Negeri Semarang
  • Amin Suyitno Universitas Negeri Semarang
Keywords: Simulasi; Algoritma Floyd-Warshall; Lintasan Terpendek

Abstract

This study aimes to know the result of simulation program of road network by using Floyd-Warshall algorithm and visual basic programing. This study also aims to prove that the manual calculation is not different with the simulation of road networking in finding the shortest path of a graph. The method include (1) problem identification, (2) study of litetature, (3) data collection, (4) desainning and  constructing simulation program, (5) implementasion of simulation, (6) evaluation of simulation program, (7) drawing conclution. Based on road network data of semarang city with is represented in a form of graph and running simulation Floyd-Warshall algorithm which is the result of desainning and creating the program by using visual basic programming. This simulation resulting shortest path for finding from start verteks to destination verteks after represented to simulation program.Based result manual calculation and the simulation Floyd-Warshall algorithm of this graph is not different

References

Budayasa, I K. 2007. Teori Graf dan Aplikasinya. Surabaya: Unesa University Press.
Goodaire, E. G dan Parmenter, M. M. 1998. Discrete Mathematics with graf theory. Presenticehall, USA
Mardlootillah, H. I., A. Suyitno & F.Y. Arini. 2014. Simulasi Algoritma Djikstra dalam Menangani Masalah Lintasan Terpendek [ada Graf Menggunakan Visual Basic. UNNES Journal of Mathematics, 3(1): 56-61.
Purwananto, Y., A. Purwitasari, & A.W. Wibowo. 2005. Implementasi dan Analisis Algoritma Pencarian Rute Terpendek di Kota Surabaya. Jurnal Penelitian dan Pengembangan ELEKOMUNIKASI, 10(2): 94-101
Ratnasari, A., F. Ardiani, & F.A. Nurvita. 2013. Penentuan Jarak Terpendek dan Jarak Terpendek Alternative Menggunakan Algoritma Djikstra serta Estimasi Waktu Tempuh. Seminar Nasional Teknologi Informasi & Komunikasi Terapan 2013. Universitas Islam Indonesia.
Saputra, R. 2011. Sistem Informasi Geografis pencarian Rute Optimum Objek Wisata Kota Yogjakarta dengan Algoritma Floyd-Warshall. Jurnal Matematika, 14(1): 19-24.
Sushma, J. P. 2013. Shortest Path Algorithms Techniques. International Journal of Science and Modern Engineering. 1(10):8- 12.
Syukria, A., R. Johar, & Marwan. 2013. Kemampuan Komunikasi Matematis dan Habits of Mind Mahasiswa Pada Materi Lintasan Terpendek Menggunakan Algoritma Floyd- Warshall. Jurnal Peluang, 1(2):71-80.
Xiao-Yan, L. & C. Yan-Li. 2010. Application of Djikstra Algorithm in Logistics Distribution Lines. Proceedings 3^rd International Symposium on Computer Science and Computational Technology. Henan Polytechnic University.
Published
2017-02-27
Section
Articles