IMPLEMENTASI ALGORITMA DIJKSTRA DALAM PENENTUAN JALUR TERPENDEK STUDI KASUS JARAK TEMPAT KULIAH TERDEKAT

Authors

  • Muhammad Muharrom Universitas Bina Sarana Informatika, Fakultas Teknologi Informasi, Prodi Teknologi Informasi

DOI:

https://doi.org/10.21927/ijubi.v3i1.1229

Keywords:

pencarian rute terpendek, algoritma dijkstra

Abstract

Bagi siapapun yang ingin bepergian menuju jakarta, darimana pun domisili orang tersebut berada, seperti wilayah bekasi yang memang salah satu wilayah yang berdekatan dengan provinsi Jakarta, entah bepergian menuju ke jakarta perihal bekerja ataupun kuliah harus mengetahui rute mana yang tercepat dan terpendek untuk dilalui dan sebisa mungkin menghindari wilayah yang macetnya parah, karena kemacetan di Jakarta sudah menjadi pemandangan sehari-hari. Banyak langkah langkah yang telah dilakukan oleh pemerintah untuk mengatasi kemacetan tersebut, seperti pembangunan  fly over dan  underpass, pengoperasian jalur busway, pemberlakuan jam  tree in one  dan sebagainya. Akan tetapi kemacetan tetap saja masih sering terjadi sampai saat ini, Oleh karena itu diperlukan peran aktif dari pengguna jalan sendiri untuk dapat mengatasi kemacetan tersebut. Salah satu cara yang paling efektif yaitu dengan mencari rute alternatif yang dapat dilalui. Oleh karena itu penulis mencoba membuat study kasus perjalanan dari Ujungharapan-Bekasi menuju Menara Salemba (STMIK Nusa Mandiri) - Jakarta Pusat sebagai percobaan penerapan metode dengan menggunakan algoritma Dijkstra yang dapat menemukan jalur tercepat dan terpendek. Sehingga perjalanan dari Bekasi menuju STMIK Nusa Mandiri akan lebih cepat dan menghemat waktu, tenaga dan biaya bahan bakar.

References

Retnani WEY, Istiadi D, Roqib A. Pencarian SPBU Terdekat dan Penentuan Jarak Terpendek Menggunakan Algoritma DIJKSTRA (Studi Kasus di Kabupaten Jember). J Nas Tek Elektro. 2015;4(1):89. doi:10.25077/jnte.v4n1.132.2015

Salaki DT. Penentuan Lintasan Terpendek Dari Fmipa Ke Rektorat Dan Fakultas Lain Di Unsrat Manado Menggunakan Algoritma Djikstra. J Ilm Sains. 2011;11(1):73. doi:10.35799/jis.11.1.2011.46

Ardyan S, Suyitno A, Mulyono. Implementasi Algoritma Dijkstra Dalam Pencarian Rute Terpendek Tempat Wisata Di Kabupaten. UNNES J Math. 2017;6(2):108-116.

Pradhana, B.A. 2009. Studi Dan Implementasi Persoalan Lintasan Terpendek Suatu Graf Dengan Algoritma Dijkstra Dan Algoritma Bellman-Ford.

Munir, Rinaldi. (2012). Matematika Diskrit. Bandung: Informatika.

Downloads

Additional Files

Published

2020-07-09

Issue

Vol. 3 No. 1 (2020): Indonesian Journal of Business Intelligence (IJUBI)

Section

Articles

License

COPYRIGHT TRANSFER FORM

The copyright to this article is transferred to Alma Ata University Press if and when the article is accepted for publication. The undersigned hereby transfers any and all rights in and to the paper including without limitation all copyrights to AAU Press. The undersigned hereby represents and warrants that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required. The undersigned represents that he/she has the power and authority to make and execute this assignment.

We declare that:

1. This paper has not been published in the same form elsewhere.

2. It will not be submitted anywhere else for publication prior to acceptance/rejection by this Journal.

3. A copyright permission is obtained for materials published elsewhere and which require this permission for reproduction.

Furthermore, I/We hereby transfer the unlimited rights of publication of the above mentioned paper in whole to AAU Press. The copyright transfer covers the exclusive right to reproduce and distribute the article, including reprints, translations, photographic reproductions, microform, electronic form (offline, online) or any other reproductions of similar nature.

The corresponding author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. This agreement is to be signed by at least one of the authors who have obtained the assent of the co-author(s) where applicable. After submission of this agreement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted.

Retained Rights/Terms and Conditions

 

1. Authors retain all proprietary rights in any process, procedure, or article of manufacture described in the Work.

2. Authors may reproduce or authorize others to reproduce the Work or derivative works for the authors personal use or for company use, provided that the source and the AAU Press copyright notice are indicated, the copies are not used in any way that implies AAU Press endorsement of a product or service of any employer, and the copies themselves are not offered for sale.

3. Although authors are permitted to re-use all or portions of the Work in other works, this does not include granting third-party requests for reprinting, republishing, or other types of re-use.