SISTEM CERDAS PENENTUAN REKOMENDASI PEMILIHAN JALUR ANGKOT KOTA MALANG
Abstract views: 997
,
PDF downloads: 558
PDF downloads: 561
Keywords:
A*, A-Star, jarak terdekat, transportasi umum
Abstract
Penelitian ini mendiskusikan penerapan Struktur Diskrit, khususnya Graf, untuk menentukan jalur tercepat bagi transportasi umum Angkutan Kota (angkot). Jalur tercepat adalah jalur dengan jeda keterlambatan (latency) terkecil diantara dua node. Ada berbagai cara untuk menemukan jalur tercepat, namun tujuannya tetap sama yaitu untuk menemukan waktu perjalanan yang terpendek. Penelitian ini menerepkan metode A* untuk mencari jalur tercepat. Metode ini digunakan karena sederhana dan dapat mengakomodasi perhitungan dengan satu variabel, seperti jarak. Aplikasi yang dihasilkan dalam penelitian ini akan sangat berguna bagi pengguna transportasi umum.
Downloads
Download data is not yet available.
Published
2017-11-28
How to Cite
[1]
U. Nurhasan, E. L. Amalia, and E. S. Astuti, “SISTEM CERDAS PENENTUAN REKOMENDASI PEMILIHAN JALUR ANGKOT KOTA MALANG”, antivirus, vol. 11, no. 2, Nov. 2017.
Section
Articles
Authors who publish with this journal agree to the following terms:
- Copyright on any article is retained by the author(s).
- Author grant the journal, right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work’s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal’s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
- The article and any associated published material is distributed under the Creative Commons Attribution-ShareAlike 4.0 International License
