IMPLEMENTATION OF DIJKSTRA'S ALGORITHM FOR FINDING THE SHORTEST ROUTE BETWEEN THE OFFICE AND THE ESTIMATED PETROL COST (CASE STUDY PT. TELKOM INDONESIA REGIONAL IV JATENG-YOGYAKARTA)
Keywords:
Dijkstra’s Algorithms, shortest path, petrol estimate
Abstract
ABSTRACT
Employees get adequate facilities to support working. PT Telkom Indonesia provides car loan facilities for employee mobility. For employees with divisions whose work has high mobility, cars and costs needed to facilitate going to the destination. Borrowing the car with a predetermined procedure. Web was chosen as a means to borrow cars. The web that is created not only requires regular web, but also comes with an algorithm to find costs of petrol. The algorithm that is used is Dijkstra's algorithm. Based on literature study, Dijkstra's algorithm is able to determine the shortest route for a predetermined purpose.
References
PUSTAKA
[1] Munir, R., (2016), Algoritma Dan Pemrograman Dalam Bahasa Pascal, C, Dan C++ Edisi Keenam, Bandung,
Penerbit Informatika.
[2] Barakbah, Ali R, Tita K., dan Ahmad, S. A., (2013), Logika dan Algoritma. Surabaya, Politeknik Negeri
Surabaya.
[3] Cahyadi, M. Azan., P, M. Arif Bambang., Widhiarso, Wijang dan Yohannes,(2017),Perbandingan
Algoritma A*, Dijkstra Dan Floyd Warshall Untuk Menentukan Jalur Terpendek PadaPermainan
“Bacteria Defense”, Palembang, STMIK GI MDP
[4] Herli A.M, Indra, K. R., Purbandini, (2015), Sistem Pencarian Hotel Berdasarkan Rute Perjalanan Terpendek
Dengan Mempertimbangkan Daya Tarik Wisata Menggunakan Algoritma Greedy. Surabaya, Universitas
Airlangga.
[5] Kurnia, R.A., M. Rumani., W.P. Marisa.,(2017),Perbandingan Kompleksitas Algoritma Dijkstra,
Bellman-Ford Dan Johnson Pada Sdn (Software-Defined Networking).ISSN : 2355-9365 e-Proceeding of Engineering : Vol.4, No.3 Desember 2017
[6] Jafaar, H., M.H Zabidi, Soh A.C., Hoong, T.P., Shafie, S., Ahmad, S.A., (2014), Intelligence Guidance Parking
System Using Modified Dijkstra’s Algorithm. Malaysia, Universiti Putra Malaysia.
[7] Gupta, N., Kapil, M. Anand, K. J., Md. U., (2016), Applying Dijkstra’s Algorithm in Routing Process.
[1] Munir, R., (2016), Algoritma Dan Pemrograman Dalam Bahasa Pascal, C, Dan C++ Edisi Keenam, Bandung,
Penerbit Informatika.
[2] Barakbah, Ali R, Tita K., dan Ahmad, S. A., (2013), Logika dan Algoritma. Surabaya, Politeknik Negeri
Surabaya.
[3] Cahyadi, M. Azan., P, M. Arif Bambang., Widhiarso, Wijang dan Yohannes,(2017),Perbandingan
Algoritma A*, Dijkstra Dan Floyd Warshall Untuk Menentukan Jalur Terpendek PadaPermainan
“Bacteria Defense”, Palembang, STMIK GI MDP
[4] Herli A.M, Indra, K. R., Purbandini, (2015), Sistem Pencarian Hotel Berdasarkan Rute Perjalanan Terpendek
Dengan Mempertimbangkan Daya Tarik Wisata Menggunakan Algoritma Greedy. Surabaya, Universitas
Airlangga.
[5] Kurnia, R.A., M. Rumani., W.P. Marisa.,(2017),Perbandingan Kompleksitas Algoritma Dijkstra,
Bellman-Ford Dan Johnson Pada Sdn (Software-Defined Networking).ISSN : 2355-9365 e-Proceeding of Engineering : Vol.4, No.3 Desember 2017
[6] Jafaar, H., M.H Zabidi, Soh A.C., Hoong, T.P., Shafie, S., Ahmad, S.A., (2014), Intelligence Guidance Parking
System Using Modified Dijkstra’s Algorithm. Malaysia, Universiti Putra Malaysia.
[7] Gupta, N., Kapil, M. Anand, K. J., Md. U., (2016), Applying Dijkstra’s Algorithm in Routing Process.
Published
2019-03-20
How to Cite
Eka Andiany, F., & Hadikurniawati, W. (2019). IMPLEMENTATION OF DIJKSTRA’S ALGORITHM FOR FINDING THE SHORTEST ROUTE BETWEEN THE OFFICE AND THE ESTIMATED PETROL COST (CASE STUDY PT. TELKOM INDONESIA REGIONAL IV JATENG-YOGYAKARTA). Information Technology and Telematics, 8(2). Retrieved from https://www.unisbank.ac.id/ojs/index.php/fti3/article/view/6530
Issue
Section
Articles
