PENERAPAN ALGORITMA DIJKSTRA UNTUK MENENTUKAN RUTE TERPENDEK TEMPAT TINGGAL KE KAMPUS 2 UIN SUNAN AMPEL SURABAYA

Authors

  • Galang Nurendrawan Ramadhan UIN Sunan Ampel Surabaya
  • Raihan Khaira Alma Bachrun UIN Sunan Ampel Surabaya
  • Achmad Syaifulloh UIN Sunan Ampel Surabaya

DOI:

https://doi.org/10.21927/ijubi.v7i1.3964

Keywords:

Dijkstra Algorithm, graph, determining the shortest route

Abstract

Surabaya merupakan kota besar maka kemacetan menjadi hal yang wajar dan pemandangan sehari-hari. Kepadatan penduduk yang tinggi dan berbagai macam aktivitas membuat kota ini tidak pernah sepi dari lalu lintas manusia. Fleksibilitas yang tinggi ini sebagian besar disebabkan oleh kurangnya sarana dan prasarana jalan. Perhitungan Dijkstra dapat menciptakan waktu produktif yang efektif dalam memastikan jarak antar sistem jika dibandingkan dengan perhitungan manual karena Algoritma Dijkstra ini memberikan keluaran berupa jalur tercepat dan terpendek dari tempat asal menuju tempat tujuan

References

D. Amir Sanjaya, “Perencanaan Traffic Light Pada Simpang Jl.Purnama - Jl. M.Sohor-Jl. Letjen Sutoyo Kota Pontianak,†J. Elektron. Laut, Sipil, dan Tambang, vol. 3, no. 3, pp. 1–13, 2016.

A. Ghofur Wibowo and A. Purwo Wicaksono, “Rancang Bangun Aplikasi untuk Menentukan Jalur Terpendek Rumah Sakit di Purbalingga dengan Metode Algoritma Dijkstra (An Application Design for Determining the Shortest Path of Hospital in Purbalingga

Using Dijkstra Algorithm Method),†Juita, vol. 1, p. 21, 2012.

R. R. Al Hakim et al., “Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah,†Expert J. Manaj. Sist. Inf. dan Teknol., vol. 11, no. 1, p. 42, 2021, doi: 10.36448/expert.v11i1.1939.

M. Qomaruddin, M. T. Alawy, and dan S. Sugiono, “Perancangan Aplikasi Penentu Rute Terpendek Perjalanan Wisata di Kabupaten Jember Menggunakan Algoritma Dijkstra,†Sci. Electro, vol. 6, no. 2, pp. 31–39, 2018.

M. Muharrom, “Implementasi Algoritma Dijkstra Dalam Penentuan Jalur Terpendek Studi Kasus Jarak Tempat Kuliah Terdekat,†Indones. J. Bus. Intell., vol. 3, no. 1, p. 25, 2020, doi: 10.21927/ijubi.v3i1.1229.

N. Kusnia and R. N. Darmawan, “Penerapan Algoritma Dijkstra Untuk Menentukan Rute Terpendek Jalur Lintas Darat Dari Alun-Alun Kota Banyuwangi Menuju Alun-Alun Kota Jember,†Univ. PGRI Banyuwangi, vol. 1, no. 2, pp. 22–30,

L. Broumi, S., Bakal, A., Talea, M., Smarandache, F., & Vladareanu, “Applying Dijkstra algorithm for solving neutrosophic shortest path problem,†pp. 412–416, 2016.

Downloads

Published

2024-07-20

Issue

Vol. 7 No. 1 (2024): 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.