OPTIMALISASI RUTE PERJALANAN MENUJU KAMPUS UNIVERSITAS DUTA BANGSA SURAKARTA DENGAN METODE DYNAMIC PROGRAMMING

OPTIMALISASI RUTE PERJALANAN MENUJU KAMPUS UNIVERSITAS DUTA BANGSA SURAKARTA DENGAN METODE DYNAMIC PROGRAMMING

Authors

  • Adit Tri Wahyono Jurusan Teknik Industri, Fakultas Sains dan Teknologi, Universitas Duta Bangsa Surakarta
  • Damara Jibran Novianto Jurusan Teknik Industri, Fakultas Sains dan Teknologi, Universitas Duta Bangsa Surakarta
  • Tatang Andi Nugroho Jurusan Teknik Industri, Fakultas Sains dan Teknologi, Universitas Duta Bangsa Surakarta
  • Febrina Agusti Jurusan Teknik Industri, Fakultas Sains dan Teknologi, Universitas Duta Bangsa Surakarta

DOI:

https://doi.org/10.47701/sintech.v4i2.3924

Keywords:

Route, Optimal, Surakarta

Abstract

 

The Duta Bangsa Surakarta University campus is located on Jl. Ki Mangun Sarkoro Nusukan has become a destination for several people to work and study. Furthermore, the increasing population growth in the city of Surakarta and development developments in the city of Surakarta have also become a problem of traffic jams experienced by employees and students on their way to campus. The aim of this research is to determine the optimal distance or route from Bendosari to the Duta Bangsa Surakarta University campus which is located on Jl. Kimangun Sarkoro Nusukan. Dynamic Programming, or Dynamic Programming, is a method of solving problems by dividing the solution into a series of phases. The research results show that the shortest route to get to the Duta Bangsa Surakarta University campus which is located in Nusukan, is Bendosari, the Jamu Sukoharjo Statue, the Ir. Soekarno Solo Baru, Gemblegan Red Light, Singosaren, Pasar Legi, with a distance of 52.7 km.

References

B.Widyantoro, Arini, H. T. Sukmana, I. Muhamad Malik Matin, and D. Khairani, “The Effectiveness of forward-backward combination method in dynamic programming,†in 2021 Sixth International Conference on Informatics and Computing (ICIC), 2021, pp. 1– 5, doi: 10.1109/ICIC54025.2021.9632910.

Darmawan, A. 2011. Penentuan Rute Terpendek Pada Pengiriman Air Bersih dengan Menggunakan Metode Optimal. PKN. FT-UMM, Malang.

Hugos, M. 2003. Essentials Of Supply Chain Management. First Edition. Publisher Wiley.

Iksan, N., Masudin, I. 2013. Penentuan Rute Transportasi Terpendek Untuk Meminimalkan Biaya Menggunakan Metode Saving Matriks. JITI, 12 (2).

Radhi, F., & Hariningsih, E. (2019). Analisis Penerapan Supply Chain Management Studi Kasus Pada Perusahaan Retailer. JBTI : Jurnal Bisnis : Teori Dan Implementasi, 6(1).

Rofiq, M. A. (2022, September). Penentuan Rute Terpendek Objek Wisata Malang Raya Menggunakan Algoritma Floyd-Warshall. Universitas Islam Negeri Maulana Malik Ibrahim Malang

Saputra, K., Harahap, N. H., & Sitorus, J. S. (2020). Analisis Transportasi Pengangkutan Sampah di Kota Medan Menggunakan Dynamic Programming. Jurnal Informatika, 7(2), 126-130.

Shofi Nur Fathiya. 2011. “Penentuan Rute Travel Door to Door dengan Program Dinamis.â€Jurnal Teknik Informatika.

Downloads

Published

2024-05-02

How to Cite

Wahyono , A. T., Novianto, D. J., Nugroho, T. A., & Agusti , F. (2024). OPTIMALISASI RUTE PERJALANAN MENUJU KAMPUS UNIVERSITAS DUTA BANGSA SURAKARTA DENGAN METODE DYNAMIC PROGRAMMING: OPTIMALISASI RUTE PERJALANAN MENUJU KAMPUS UNIVERSITAS DUTA BANGSA SURAKARTA DENGAN METODE DYNAMIC PROGRAMMING. Journal Science Innovation and Technology (SINTECH), 4(2), 14–19. https://doi.org/10.47701/sintech.v4i2.3924