Optimasi Kelayakan Kondisi Pembangunan Jalan di Kota Lhokseumawe Menggunakan Algoritma Greedy

Authors

  • Eva Darnila Teknik Informatika Universitas Malikussaleh
  • Mutammimul Ula Teknik Informatika Universitas Malikussaleh
  • Cut Dewi Aida Soraya Teknik Informatika Universitas Malikussaleh

DOI:

https://doi.org/10.53842/juki.v1i1.3

Keywords:

Optimization, Roads, Greedy Algorithms, Nearby Paths

Abstract

Lhokseumawe City is one of the cities on the east coast of Aceh. The Lhokseumawe City area is the result of the expansion of the North Aceh region, where existing transportation facilities and infrastructure need to be optimized for development. Development is expected to improve the economy of the population around Lhokseumawe City, especially in the road construction sector. Considering the population growth in the Lhoseumawe City region which continues to increase every year, so that optimal road construction is expected to facilitate the mobility of the surrounding population in carrying out daily activities. To find out the condition of the existing roads around the city of Lhokseumawe in this study, the Indonesian Road Capacity Manual (MKJI) will be used to measure the degree of saturation of a road section in the Lhokseumawe City area. And the optimization is then used Greedy Algorithm, where this greedy algorithm is an optimization algorithm commonly used to solve optimization problems even though the results are not always optimal. The Greedy algorithm applied in this application will try to optimize by finding the nearest path from the Simpang Len road to Riyadhah Park by taking the coordinates (latitude and longitude) of the nodes to be passed. From the search results of the node that is depicted into graphs then it produces the optimal path that will be passed by the user is A → B → C → D → F → G → K → L → M → Q with a total distance of 9.8 km.

Downloads

Download data is not yet available.

References

D. Mahamurah, M. Kaunang, and S. Sambiran, “OPTIMALISASI ALOKASI DANA DESA DALAM MENINGKATKAN PEMBANGUNAN DESA (Studi di Desa Nahepese Kecamatan Manganitu),” J. Eksek., vol. 1, no. 1, 2017.

E. N. Hayati and A. Yohanes, “Pencarian Rute Terpendek Menggunakan Algoritma Greedy,” Semin. Nas. IENACO, pp. 2337–4349, 2014.

Y. P. Ma’ruf and J. Daud, “Pengaruh investasi infrastruktur jalan terhadap pertumbuhan ekonomi wilayah di kabupaten pesisir selatan provinsi sumatera barat,” J. Tek. Sipil USU, vol. 2, no. 3, pp. 1–13, 2013.

R. Munir, “Algoritma & Pemrograman dalam Bahasa Pascal dan C Edisi Revisi,” Andi Yogyakarta, 2011. [Online]. Available: https://openlibrary.telkomuniversity.ac.id/pustaka/21198/algoritma-pemrograman-dalam-bahasa-pascal-dan-c-edisi-revisi.html. [Accessed: 19-Feb- 2020].

D. Rachmawati and A. Candra, “Implementasi Algoritma Greedy untuk Menyelesaikan Masalah Knapsack Problem,” J. SAINTIKOM, vol. 12, no. 3, pp. 185–192, 2013.

S. A. Curtis, “The classification of greedy algorithms,” Sci. Comput. Program., vol. 49, no. 1–3, pp. 125–157, Dec. 2003, doi: 10.1016/j.scico.2003.09.001.

A. Ambarwari and N. Yanto, Penerapan Algoritma Greedy Pada Permasalahan Knapsack Untuk Optimasi Pengangkutan Peti Kemas. 2016.

Downloads

Published

2019-05-27

How to Cite

Eva Darnila, Mutammimul Ula, & Cut Dewi Aida Soraya. (2019). Optimasi Kelayakan Kondisi Pembangunan Jalan di Kota Lhokseumawe Menggunakan Algoritma Greedy. JUKI : Jurnal Komputer Dan Informatika, 1(1), 9–14. https://doi.org/10.53842/juki.v1i1.3