The Comparasion Determining of Some Route of Angkot In Bandung by Using Greedy Algorithm and Min Plus Algorithm
Abstract
Bandung is one of the major cities in Indonesia. The lower middle class is greatly helped by public transportation. Angkot is transportation that is close to the people. However, public transportation services that are less organized can make people switch to using private transportation. This actually has a bad impact on traffic. Thus, there need to be improvements in public transportation in the city of Bandung. One-way roads in the city of Bandung are also the cause of many angkot routes. The choice of public transportation users to choose an efficient angkot route. Efficient here means a short path so that the travel time to the destination is minimal. In the previous article, the Cicaheum Ciroyom and Ujung Berung ITB angkot routes were obtained using the Greedy algorithm. In this discussion, the algorithm that can be used to determine angkot routes in Bandung is the Min-Plus algorithm. After being compared between the Greedy algorithm and the Min plus algorithm, the resulting angkot algorithm is better obtained by the Min Plus algorithm.
Downloads
References
[2] H. A. Alvin Yuvianto, "Implementasi Algoritma Greedy Pada Pencarian Langkah Optimal Permainan Mahjong Solitaire," Jurnal Rekayasa Sistem dan Teknologi Informasi, vol. 1, pp. 226-231, 2017.
[3] A. C. Dian Rachmawati, "Implementasi Algoritma Greedy Untuk Menyelesaikan Masalah Knapsack Problem," Jurnal Sains dan Komputer, vol. 12, pp. 185-192, 2013.
[4] Y. W. Sennosuke Watanabe, "Min Plus Algebra and Networks," RIMS Kokyuroku Bessatsu, pp. 41-54, 2014.
[5] M. S. K. I. S. Diana Okta Pugas, "Pencarian Rute Terpendek Menggunakan Algoritma Dijkstra dan Astar(A*) pada SIG berbasis Web Untuk Pemetaan Pariwisata kota Sawahlunto," Transmisi, vol. 13(1), pp. 27 - 32 , 2011.
[6] S. S. Kistosil Fahim, "Aplikasi Aljabar Max Plus Pada Pemodelan Dan Penjadwalan Busway Yang Diintegrasikan dengan Kereta Komuter," Jurnal Teknik Pomits, vol. I, pp. 1 -6, 2013.
[7] P. B. R. N. I. D. Vivi Suwanti, "Penerapan Min Plus Algebra Pada Penentuan Rute Tercepat Distribusi Susu," Limits, vol. 14(2), pp. 103 - 112, 2017.
[8] S. H., "Correctness Proof of Min Plus Algebra for Network Shortest Paths Simultaneous Calculation," Journal of Technology and Social Science (JTSS), vol. 1(1), pp. 61 - 69, 2017.
[9] C. Gunawan, "Simulasi Pencarian Rute Angkot Cicaheum Ciroyom Kota Bandung Menggunakan Algoritma Greedy," 2012.
[10] Shirley, "Penggunaan Algoritma Greedy dalam Penentuan Jalur Angkot di Bandung," Institut Teknologi Bandung, Bandung, 2010.
[11] M. A. Rudhito, "Sistem Persamaan Linear Min Plus dan Penerapannya pada Masalah Lintasan Terpendek," in Seminar Nasional Matematika dan Pendidikan Matematika Universitas Negeri Yogyakarta, Yogyakarta, 2013.
[12] E. Horowitz, Computer Algorithms, 2nd Edition,, USA: SIlicon Press, 2008.
[13] M. A. Rudhito, Aljabar Max Plus dan Penerapannya, Yogyakarta: Universitas Sanata Dharma Press, 2016.
[14] Mustofa, "Sistem Persamaan Linear Pada Aljabar Min Plus," in Seminar Nasional Penelitian, Pendidikan dan Penerapan MIPA Univeritas Negeri Yogyakarta, Yogyakarta, 2011.
[15] Subiono, Aljabar Min Plus dan Terapannya, Version 3.0.0., Surabaya: Institut Teknologi Sepuluh November, 2015.
[16] H. S. Lubis, "Perbandingan Algoritma Greedy dan Dijkstra Untuk Menentukan Lintasan Terpendek," Universitas Sumatra Utara, Medan, 2009.
[17] I. T. P. Alamsyah, "Penerapan Algoritma Greedy Pada Mesin Penjual Otomatis(Vending Machine)," Scientific Journal of Informatics, vol. 1, pp. 201 - 209, 2014.
[18] A. Juniar, "Penerapan Algoritma Greedy Pada Penjadwalan Produksi Single-Stage dengan Parallel Machine di Industri Konveksi," Jurnal SIFO Mikrosil, vol. 16, pp. 175-184, 2015.
[19] P. Wahyuningsih, "Penerapan Algoritma Greedy Untuk Mendeteksi Aktivitas Lansia Pada Karpet Menggunakan Arduino Mega," Jurnal Informatika Sains dan Teknologi, vol. 3, pp. 51-60, 2018.
[20] D. Wiliam Aprilius, "Implementasi Algoritma MAX-MIN Ant System Pada Penjadwalan Mata Kuliah," Jurnal ULTIMATICS, vol. V, pp. 48-53, 2013.
The Authors submitting a manuscript do so on the understanding that if accepted for publication, the copyright of the article shall be assigned to Jurnal Lontar Komputer as the publisher of the journal. Copyright encompasses exclusive rights to reproduce and deliver the article in all forms and media, as well as translations. The reproduction of any part of this journal (printed or online) will be allowed only with written permission from Jurnal Lontar Komputer. The Editorial Board of Jurnal Lontar Komputer makes every effort to ensure that no wrong or misleading data, opinions, or statements be published in the journal.
This work is licensed under a Creative Commons Attribution 4.0 International License.
